./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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/sll2c_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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:09:31,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:09:31,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:09:31,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:09:31,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:09:31,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:09:31,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:09:31,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:09:31,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:09:31,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:09:31,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:09:31,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:09:31,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:09:31,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:09:31,121 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:09:31,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:09:31,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:09:31,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:09:31,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:09:31,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:09:31,122 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:09:31,122 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:09:31,123 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:09:31,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:09:31,123 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:09:31,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:09:31,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:09:31,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:09:31,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:09:31,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:09:31,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:09:31,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:09:31,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:09:31,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:09:31,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:09:31,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:09:31,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:09:31,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:09:31,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:09:31,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:09:31,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:09:31,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:09:31,125 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2025-03-08 23:09:31,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:09:31,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:09:31,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:09:31,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:09:31,337 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:09:31,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2025-03-08 23:09:32,470 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f924b0cff/506269bf6dc147faa19f8e05fd4b5f24/FLAG84fad93d0 [2025-03-08 23:09:32,764 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:09:32,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2025-03-08 23:09:32,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f924b0cff/506269bf6dc147faa19f8e05fd4b5f24/FLAG84fad93d0 [2025-03-08 23:09:32,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f924b0cff/506269bf6dc147faa19f8e05fd4b5f24 [2025-03-08 23:09:32,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:09:32,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:09:32,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:09:32,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:09:32,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:09:32,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:09:32" (1/1) ... [2025-03-08 23:09:32,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6b34fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:32, skipping insertion in model container [2025-03-08 23:09:32,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:09:32" (1/1) ... [2025-03-08 23:09:32,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:09:33,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:09:33,068 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:09:33,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:09:33,136 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:09:33,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33 WrapperNode [2025-03-08 23:09:33,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:09:33,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:09:33,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:09:33,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:09:33,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,175 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 139 [2025-03-08 23:09:33,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:09:33,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:09:33,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:09:33,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:09:33,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,206 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 13, 9]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 7, 1]. [2025-03-08 23:09:33,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:09:33,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:09:33,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:09:33,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:09:33,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (1/1) ... [2025-03-08 23:09:33,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:09:33,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:33,253 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-08 23:09:33,258 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-08 23:09:33,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:09:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:09:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 23:09:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:09:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 23:09:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 23:09:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-08 23:09:33,273 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-08 23:09:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:09:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:09:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 23:09:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:09:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 23:09:33,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 23:09:33,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:09:33,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:09:33,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 23:09:33,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:09:33,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 23:09:33,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 23:09:33,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 23:09:33,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:09:33,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:09:33,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 23:09:33,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:09:33,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:09:33,386 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:09:33,387 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:09:33,633 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L623: 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-08 23:09:33,657 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-08 23:09:33,675 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-08 23:09:33,675 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:09:33,682 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:09:33,683 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:09:33,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:09:33 BoogieIcfgContainer [2025-03-08 23:09:33,683 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:09:33,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:09:33,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:09:33,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:09:33,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:09:32" (1/3) ... [2025-03-08 23:09:33,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0bb09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:09:33, skipping insertion in model container [2025-03-08 23:09:33,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:09:33" (2/3) ... [2025-03-08 23:09:33,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0bb09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:09:33, skipping insertion in model container [2025-03-08 23:09:33,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:09:33" (3/3) ... [2025-03-08 23:09:33,692 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2025-03-08 23:09:33,704 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:09:33,705 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_equal.i that has 2 procedures, 119 locations, 1 initial locations, 4 loop locations, and 50 error locations. [2025-03-08 23:09:33,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:09:33,749 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;@f0d6c38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:09:33,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-08 23:09:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 64 states have (on average 1.96875) internal successors, (126), 114 states have internal predecessors, (126), 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-08 23:09:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:09:33,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:33,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:09:33,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:33,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash 171819732, now seen corresponding path program 1 times [2025-03-08 23:09:33,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:33,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674468871] [2025-03-08 23:09:33,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:33,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:33,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:09:33,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:09:33,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:33,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:33,943 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-08 23:09:33,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:33,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674468871] [2025-03-08 23:09:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674468871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:33,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:33,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:09:33,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673976175] [2025-03-08 23:09:33,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:33,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:09:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:33,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:09:33,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:33,972 INFO L87 Difference]: Start difference. First operand has 119 states, 64 states have (on average 1.96875) internal successors, (126), 114 states have internal predecessors, (126), 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) 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-08 23:09:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:34,106 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2025-03-08 23:09:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:09:34,108 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-08 23:09:34,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:34,112 INFO L225 Difference]: With dead ends: 116 [2025-03-08 23:09:34,113 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 23:09:34,114 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-08 23:09:34,115 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:34,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 188 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 23:09:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-08 23:09:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 108 states have internal predecessors, (115), 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-08 23:09:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2025-03-08 23:09:34,139 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 6 [2025-03-08 23:09:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:34,140 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2025-03-08 23:09:34,140 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-08 23:09:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2025-03-08 23:09:34,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:09:34,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:34,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:09:34,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:09:34,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:34,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:34,141 INFO L85 PathProgramCache]: Analyzing trace with hash 171819733, now seen corresponding path program 1 times [2025-03-08 23:09:34,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:34,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991656065] [2025-03-08 23:09:34,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:34,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:34,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:09:34,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:09:34,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:34,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:34,248 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-08 23:09:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991656065] [2025-03-08 23:09:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991656065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:34,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:34,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:09:34,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337229968] [2025-03-08 23:09:34,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:34,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:09:34,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:34,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:09:34,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:34,251 INFO L87 Difference]: Start difference. First operand 113 states and 121 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-08 23:09:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:34,304 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2025-03-08 23:09:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:09:34,305 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-08 23:09:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:34,305 INFO L225 Difference]: With dead ends: 111 [2025-03-08 23:09:34,305 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 23:09:34,306 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-08 23:09:34,306 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:34,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 189 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 23:09:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-08 23:09:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 106 states have internal predecessors, (113), 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-08 23:09:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2025-03-08 23:09:34,314 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 6 [2025-03-08 23:09:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:34,314 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2025-03-08 23:09:34,314 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-08 23:09:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2025-03-08 23:09:34,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 23:09:34,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:34,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:34,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:09:34,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:34,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:34,315 INFO L85 PathProgramCache]: Analyzing trace with hash 584416500, now seen corresponding path program 1 times [2025-03-08 23:09:34,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:34,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499257705] [2025-03-08 23:09:34,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:34,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:34,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 23:09:34,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 23:09:34,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:34,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:34,405 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-08 23:09:34,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:34,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499257705] [2025-03-08 23:09:34,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499257705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:34,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:34,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:09:34,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077546611] [2025-03-08 23:09:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:34,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:09:34,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:34,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:09:34,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:09:34,408 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:09:34,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:34,423 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2025-03-08 23:09:34,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:09:34,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-08 23:09:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:34,425 INFO L225 Difference]: With dead ends: 118 [2025-03-08 23:09:34,425 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 23:09:34,425 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-08 23:09:34,425 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 5 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:34,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 229 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:09:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 23:09:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2025-03-08 23:09:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 62 states have (on average 1.8387096774193548) internal successors, (114), 107 states have internal predecessors, (114), 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-08 23:09:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2025-03-08 23:09:34,435 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 13 [2025-03-08 23:09:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:34,438 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2025-03-08 23:09:34,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:09:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2025-03-08 23:09:34,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:09:34,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:34,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:34,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:09:34,439 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:34,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1379489550, now seen corresponding path program 1 times [2025-03-08 23:09:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:34,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015210557] [2025-03-08 23:09:34,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:34,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:34,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:09:34,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:09:34,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:34,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:09:34,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:34,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015210557] [2025-03-08 23:09:34,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015210557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:34,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:34,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:09:34,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698806521] [2025-03-08 23:09:34,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:34,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:09:34,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:34,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:09:34,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:09:34,580 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 23:09:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:34,727 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2025-03-08 23:09:34,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:09:34,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-08 23:09:34,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:34,729 INFO L225 Difference]: With dead ends: 111 [2025-03-08 23:09:34,730 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 23:09:34,730 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-08 23:09:34,730 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:34,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 355 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 23:09:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-08 23:09:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 62 states have (on average 1.8225806451612903) internal successors, (113), 106 states have internal predecessors, (113), 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-08 23:09:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2025-03-08 23:09:34,740 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 22 [2025-03-08 23:09:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:34,740 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2025-03-08 23:09:34,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 23:09:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2025-03-08 23:09:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:09:34,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:34,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:34,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:09:34,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:34,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:34,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1379489551, now seen corresponding path program 1 times [2025-03-08 23:09:34,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:34,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642515866] [2025-03-08 23:09:34,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:34,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:09:34,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:09:34,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:34,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:34,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:34,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642515866] [2025-03-08 23:09:34,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642515866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:34,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:34,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:09:34,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174490288] [2025-03-08 23:09:34,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:34,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:09:34,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:34,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:09:34,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:09:34,895 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 23:09:35,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:35,012 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2025-03-08 23:09:35,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:09:35,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-08 23:09:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:35,013 INFO L225 Difference]: With dead ends: 110 [2025-03-08 23:09:35,014 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 23:09:35,014 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-08 23:09:35,014 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:35,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 379 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 23:09:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 23:09:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 62 states have (on average 1.8064516129032258) internal successors, (112), 105 states have internal predecessors, (112), 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-08 23:09:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2025-03-08 23:09:35,022 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 22 [2025-03-08 23:09:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:35,022 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2025-03-08 23:09:35,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 23:09:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2025-03-08 23:09:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:09:35,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:35,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:35,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:09:35,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:35,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:35,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2126175576, now seen corresponding path program 1 times [2025-03-08 23:09:35,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:35,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622997969] [2025-03-08 23:09:35,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:35,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:35,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:09:35,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:09:35,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:35,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:35,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:35,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622997969] [2025-03-08 23:09:35,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622997969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:35,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125598220] [2025-03-08 23:09:35,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:35,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:35,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:35,215 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-08 23:09:35,217 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-08 23:09:35,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:09:35,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:09:35,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:35,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:35,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 23:09:35,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:35,330 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-08 23:09:35,386 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:09:35,387 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-08 23:09:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:35,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:35,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125598220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:35,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:35,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-03-08 23:09:35,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102133817] [2025-03-08 23:09:35,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:35,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 23:09:35,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:35,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 23:09:35,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-08 23:09:35,707 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 23:09:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:36,091 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2025-03-08 23:09:36,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:09:36,092 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-08 23:09:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:36,092 INFO L225 Difference]: With dead ends: 109 [2025-03-08 23:09:36,092 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 23:09:36,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-08 23:09:36,093 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:36,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 861 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:09:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 23:09:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-08 23:09:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 62 states have (on average 1.7903225806451613) internal successors, (111), 104 states have internal predecessors, (111), 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-08 23:09:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2025-03-08 23:09:36,097 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 25 [2025-03-08 23:09:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:36,097 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2025-03-08 23:09:36,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 23:09:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2025-03-08 23:09:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:09:36,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:36,098 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:36,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 23:09:36,302 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-08 23:09:36,302 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:36,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:36,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2126175577, now seen corresponding path program 1 times [2025-03-08 23:09:36,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:36,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093872255] [2025-03-08 23:09:36,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:36,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:36,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:09:36,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:09:36,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:36,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:36,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:36,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093872255] [2025-03-08 23:09:36,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093872255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:36,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808722753] [2025-03-08 23:09:36,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:36,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:36,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:36,625 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-08 23:09:36,627 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-08 23:09:36,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:09:36,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:09:36,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:36,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:36,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 23:09:36,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:36,729 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-08 23:09:36,734 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-08 23:09:36,887 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:09:36,887 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-08 23:09:36,892 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-08 23:09:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:09:36,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808722753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:37,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2025-03-08 23:09:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486828308] [2025-03-08 23:09:37,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:37,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 23:09:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:37,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 23:09:37,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-08 23:09:37,041 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 23:09:37,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:37,421 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2025-03-08 23:09:37,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:09:37,421 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-03-08 23:09:37,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:37,422 INFO L225 Difference]: With dead ends: 110 [2025-03-08 23:09:37,422 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 23:09:37,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-03-08 23:09:37,423 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 3 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:37,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 616 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:09:37,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 23:09:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2025-03-08 23:09:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 62 states have (on average 1.7741935483870968) internal successors, (110), 103 states have internal predecessors, (110), 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-08 23:09:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2025-03-08 23:09:37,426 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 25 [2025-03-08 23:09:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:37,426 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2025-03-08 23:09:37,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 23:09:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2025-03-08 23:09:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:09:37,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:37,427 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:37,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 23:09:37,627 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-08 23:09:37,628 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:37,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2001120428, now seen corresponding path program 1 times [2025-03-08 23:09:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:37,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50680877] [2025-03-08 23:09:37,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:37,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:37,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:09:37,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:09:37,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:37,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:09:37,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:37,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50680877] [2025-03-08 23:09:37,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50680877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:37,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753500541] [2025-03-08 23:09:37,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:37,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:37,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:37,972 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-08 23:09:37,974 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-08 23:09:38,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:09:38,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:09:38,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:38,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:38,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 23:09:38,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:38,080 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-08 23:09:38,093 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-08 23:09:38,123 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 23:09:38,124 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-08 23:09:38,161 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:09:38,161 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-08 23:09:38,206 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-08 23:09:38,235 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:09:38,236 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-08 23:09:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2025-03-08 23:09:38,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:38,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753500541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:38,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:38,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2025-03-08 23:09:38,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781198482] [2025-03-08 23:09:38,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:38,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 23:09:38,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:38,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 23:09:38,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=379, Unknown=2, NotChecked=82, Total=552 [2025-03-08 23:09:38,548 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 23:09:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:38,900 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2025-03-08 23:09:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:09:38,901 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2025-03-08 23:09:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:38,901 INFO L225 Difference]: With dead ends: 118 [2025-03-08 23:09:38,901 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 23:09:38,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=486, Unknown=2, NotChecked=94, Total=702 [2025-03-08 23:09:38,902 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 184 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:38,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 405 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 493 Invalid, 0 Unknown, 240 Unchecked, 0.3s Time] [2025-03-08 23:09:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 23:09:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2025-03-08 23:09:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 95 states have internal predecessors, (102), 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-08 23:09:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2025-03-08 23:09:38,905 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 37 [2025-03-08 23:09:38,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:38,905 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2025-03-08 23:09:38,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 23:09:38,906 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2025-03-08 23:09:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:09:38,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:38,906 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:38,913 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-08 23:09:39,111 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-08 23:09:39,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:39,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2001120429, now seen corresponding path program 1 times [2025-03-08 23:09:39,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:39,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723707106] [2025-03-08 23:09:39,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:39,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:09:39,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:09:39,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:39,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:39,488 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:39,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:39,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723707106] [2025-03-08 23:09:39,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723707106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:39,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468364057] [2025-03-08 23:09:39,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:39,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:39,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:39,491 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-08 23:09:39,493 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-08 23:09:39,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:09:39,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:09:39,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:39,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:39,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 23:09:39,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:39,597 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-08 23:09:39,601 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-08 23:09:39,606 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-08 23:09:39,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:39,631 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-08 23:09:39,645 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-08 23:09:39,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:39,670 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-08 23:09:39,718 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-08 23:09:39,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:39,754 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-08 23:09:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:09:39,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:09:39,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468364057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:39,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:09:39,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 15 [2025-03-08 23:09:39,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768026809] [2025-03-08 23:09:39,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:39,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:09:39,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:39,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:09:39,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2025-03-08 23:09:39,763 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:39,873 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2025-03-08 23:09:39,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:09:39,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-08 23:09:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:39,874 INFO L225 Difference]: With dead ends: 95 [2025-03-08 23:09:39,874 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 23:09:39,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2025-03-08 23:09:39,875 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 22 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:39,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 276 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 130 Unchecked, 0.1s Time] [2025-03-08 23:09:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 23:09:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-08 23:09:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.564516129032258) internal successors, (97), 90 states have internal predecessors, (97), 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-08 23:09:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2025-03-08 23:09:39,877 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 37 [2025-03-08 23:09:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:39,877 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2025-03-08 23:09:39,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:09:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2025-03-08 23:09:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 23:09:39,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:39,882 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:39,888 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-08 23:09:40,082 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-08 23:09:40,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:40,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1068616023, now seen corresponding path program 1 times [2025-03-08 23:09:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:40,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714373310] [2025-03-08 23:09:40,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:40,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:40,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 23:09:40,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 23:09:40,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:40,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 23:09:40,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714373310] [2025-03-08 23:09:40,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714373310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:40,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:09:40,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:09:40,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522398002] [2025-03-08 23:09:40,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:40,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:09:40,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:40,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:09:40,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:09:40,161 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:09:40,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:40,251 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2025-03-08 23:09:40,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:09:40,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-03-08 23:09:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:40,252 INFO L225 Difference]: With dead ends: 93 [2025-03-08 23:09:40,252 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 23:09:40,252 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-08 23:09:40,252 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 19 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:40,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 286 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 23:09:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 23:09:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.532258064516129) internal successors, (95), 88 states have internal predecessors, (95), 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-08 23:09:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2025-03-08 23:09:40,257 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 39 [2025-03-08 23:09:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:40,257 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2025-03-08 23:09:40,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:09:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2025-03-08 23:09:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 23:09:40,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:40,259 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:40,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 23:09:40,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:40,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:40,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1068616022, now seen corresponding path program 1 times [2025-03-08 23:09:40,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:40,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124511289] [2025-03-08 23:09:40,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:40,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:40,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 23:09:40,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 23:09:40,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:40,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:40,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:40,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124511289] [2025-03-08 23:09:40,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124511289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:40,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302292121] [2025-03-08 23:09:40,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:40,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:40,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:40,390 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-08 23:09:40,392 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-08 23:09:40,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 23:09:40,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 23:09:40,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:40,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:40,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 23:09:40,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 23:09:40,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:09:40,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302292121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:40,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:09:40,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-03-08 23:09:40,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543140464] [2025-03-08 23:09:40,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:40,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:09:40,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:40,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:09:40,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-08 23:09:40,563 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:09:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:40,649 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2025-03-08 23:09:40,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:09:40,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-03-08 23:09:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:40,650 INFO L225 Difference]: With dead ends: 91 [2025-03-08 23:09:40,650 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 23:09:40,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-08 23:09:40,651 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 20 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:40,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 319 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:09:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 23:09:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 23:09:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.5) internal successors, (93), 86 states have internal predecessors, (93), 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-08 23:09:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2025-03-08 23:09:40,653 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 39 [2025-03-08 23:09:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:40,653 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2025-03-08 23:09:40,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:09:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2025-03-08 23:09:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:09:40,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:40,654 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:40,660 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-08 23:09:40,854 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,SelfDestructingSolverStorable10 [2025-03-08 23:09:40,855 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:40,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:40,856 INFO L85 PathProgramCache]: Analyzing trace with hash -441951259, now seen corresponding path program 1 times [2025-03-08 23:09:40,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:40,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102204670] [2025-03-08 23:09:40,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:40,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:40,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:09:40,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:09:40,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:40,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:41,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:41,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102204670] [2025-03-08 23:09:41,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102204670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:41,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919191102] [2025-03-08 23:09:41,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:41,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:41,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:41,118 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-08 23:09:41,120 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-08 23:09:41,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:09:41,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:09:41,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:41,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:41,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 23:09:41,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:41,443 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-08 23:09:41,451 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-08 23:09:41,486 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-08 23:09:41,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-03-08 23:09:41,501 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-08 23:09:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-08 23:09:41,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:41,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919191102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:41,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:41,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2025-03-08 23:09:41,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819911391] [2025-03-08 23:09:41,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:41,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 23:09:41,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:41,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 23:09:41,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=493, Unknown=1, NotChecked=44, Total=600 [2025-03-08 23:09:41,554 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 21 states have internal predecessors, (61), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:09:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:42,004 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2025-03-08 23:09:42,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 23:09:42,004 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 21 states have internal predecessors, (61), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-08 23:09:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:42,005 INFO L225 Difference]: With dead ends: 93 [2025-03-08 23:09:42,005 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 23:09:42,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=879, Unknown=1, NotChecked=60, Total=1056 [2025-03-08 23:09:42,006 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 88 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:42,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 818 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 820 Invalid, 0 Unknown, 97 Unchecked, 0.3s Time] [2025-03-08 23:09:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 23:09:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2025-03-08 23:09:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 85 states have internal predecessors, (93), 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-08 23:09:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2025-03-08 23:09:42,008 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 41 [2025-03-08 23:09:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:42,008 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2025-03-08 23:09:42,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 21 states have internal predecessors, (61), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:09:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2025-03-08 23:09:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:09:42,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:42,009 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:42,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 23:09:42,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:42,210 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:42,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:42,210 INFO L85 PathProgramCache]: Analyzing trace with hash -441951258, now seen corresponding path program 1 times [2025-03-08 23:09:42,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:42,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222187324] [2025-03-08 23:09:42,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:42,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:42,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:09:42,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:09:42,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:42,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:42,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:42,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222187324] [2025-03-08 23:09:42,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222187324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:42,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066955622] [2025-03-08 23:09:42,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:42,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:42,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:42,593 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-08 23:09:42,605 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-08 23:09:42,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:09:42,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:09:42,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:42,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:42,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 23:09:42,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:42,775 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-08 23:09:42,958 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-08 23:09:42,961 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-08 23:09:42,994 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_5|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-03-08 23:09:43,030 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 23:09:43,030 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-08 23:09:43,034 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-08 23:09:43,091 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-08 23:09:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-08 23:09:43,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:43,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066955622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:43,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:09:43,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2025-03-08 23:09:43,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981433767] [2025-03-08 23:09:43,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:43,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 23:09:43,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:43,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 23:09:43,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=786, Unknown=1, NotChecked=56, Total=930 [2025-03-08 23:09:43,244 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 27 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 23 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:09:43,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:43,879 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2025-03-08 23:09:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 23:09:43,879 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 23 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-03-08 23:09:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:43,881 INFO L225 Difference]: With dead ends: 102 [2025-03-08 23:09:43,881 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 23:09:43,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=1335, Unknown=1, NotChecked=74, Total=1560 [2025-03-08 23:09:43,881 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 77 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:43,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 856 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 971 Invalid, 0 Unknown, 105 Unchecked, 0.4s Time] [2025-03-08 23:09:43,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 23:09:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-08 23:09:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:09:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2025-03-08 23:09:43,884 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 41 [2025-03-08 23:09:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:43,884 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2025-03-08 23:09:43,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 23 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:09:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2025-03-08 23:09:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 23:09:43,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:43,885 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:43,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 23:09:44,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:44,089 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:44,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -842309513, now seen corresponding path program 1 times [2025-03-08 23:09:44,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:44,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416374168] [2025-03-08 23:09:44,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:44,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 23:09:44,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 23:09:44,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:44,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416374168] [2025-03-08 23:09:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416374168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781984182] [2025-03-08 23:09:44,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:44,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:44,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:44,289 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-08 23:09:44,291 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-08 23:09:44,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 23:09:44,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 23:09:44,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:44,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:44,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 23:09:44,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:44,429 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-08 23:09:44,445 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-08 23:09:44,459 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-08 23:09:44,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:44,481 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-08 23:09:44,496 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-08 23:09:44,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:44,524 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-08 23:09:44,559 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-08 23:09:44,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:09:44,587 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-08 23:09:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:09:44,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:09:44,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781984182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:09:44,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:09:44,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-08 23:09:44,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912756012] [2025-03-08 23:09:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:09:44,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:09:44,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:44,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:09:44,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=133, Unknown=1, NotChecked=22, Total=182 [2025-03-08 23:09:44,614 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:09:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:09:44,673 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2025-03-08 23:09:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:09:44,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-08 23:09:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:09:44,674 INFO L225 Difference]: With dead ends: 98 [2025-03-08 23:09:44,674 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 23:09:44,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=133, Unknown=1, NotChecked=22, Total=182 [2025-03-08 23:09:44,674 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 36 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:09:44,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 179 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 111 Unchecked, 0.1s Time] [2025-03-08 23:09:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 23:09:44,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-08 23:09:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.36986301369863) internal successors, (100), 92 states have internal predecessors, (100), 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-08 23:09:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2025-03-08 23:09:44,677 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 42 [2025-03-08 23:09:44,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:09:44,677 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2025-03-08 23:09:44,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:09:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2025-03-08 23:09:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 23:09:44,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:09:44,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:09:44,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 23:09:44,883 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,SelfDestructingSolverStorable13 [2025-03-08 23:09:44,884 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:09:44,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:09:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2005590382, now seen corresponding path program 1 times [2025-03-08 23:09:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:09:44,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040119853] [2025-03-08 23:09:44,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:09:44,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 23:09:44,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 23:09:44,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:44,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:45,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:09:45,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040119853] [2025-03-08 23:09:45,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040119853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:09:45,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244406498] [2025-03-08 23:09:45,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:09:45,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:09:45,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:09:45,059 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-08 23:09:45,060 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-08 23:09:45,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 23:09:45,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 23:09:45,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:09:45,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:09:45,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 23:09:45,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:09:45,361 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:09:45,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:09:45,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 23:09:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:09:45,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:09:45,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:09:45,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-03-08 23:09:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 23:09:45,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244406498] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:09:45,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:09:45,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 23 [2025-03-08 23:09:45,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598256502] [2025-03-08 23:09:45,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:09:45,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 23:09:45,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:09:45,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 23:09:45,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-03-08 23:09:45,553 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-08 23:09:49,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 23:09:53,592 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-08 23:09:57,624 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-08 23:10:01,641 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-08 23:10:05,858 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-08 23:10:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:05,860 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2025-03-08 23:10:05,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 23:10:05,861 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 44 [2025-03-08 23:10:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:05,861 INFO L225 Difference]: With dead ends: 99 [2025-03-08 23:10:05,861 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 23:10:05,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2025-03-08 23:10:05,862 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 123 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:05,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1173 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 416 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-03-08 23:10:05,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 23:10:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2025-03-08 23:10:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:10:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2025-03-08 23:10:05,864 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 44 [2025-03-08 23:10:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:05,864 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2025-03-08 23:10:05,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-08 23:10:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2025-03-08 23:10:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:10:05,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:05,865 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:05,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 23:10:06,065 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,SelfDestructingSolverStorable14 [2025-03-08 23:10:06,066 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:10:06,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:06,066 INFO L85 PathProgramCache]: Analyzing trace with hash 911954170, now seen corresponding path program 1 times [2025-03-08 23:10:06,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:06,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500209053] [2025-03-08 23:10:06,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:06,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:06,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:10:06,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:10:06,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:06,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:06,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:06,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500209053] [2025-03-08 23:10:06,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500209053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:06,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488245506] [2025-03-08 23:10:06,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:06,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:06,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:06,768 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-08 23:10:06,769 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-08 23:10:06,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:10:07,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:10:07,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:07,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:07,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-08 23:10:07,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:07,054 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-08 23:10:07,184 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:07,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 11 treesize of output 11 [2025-03-08 23:10:07,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:10:07,345 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:07,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-08 23:10:07,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 23:10:07,479 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-08 23:10:07,650 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_8|) 0) 0))) is different from true [2025-03-08 23:10:07,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:07,672 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 38 treesize of output 27 [2025-03-08 23:10:07,693 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2025-03-08 23:10:07,693 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 36 treesize of output 52 [2025-03-08 23:10:07,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 7 treesize of output 3 [2025-03-08 23:10:07,869 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 46 treesize of output 26 [2025-03-08 23:10:07,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 23:10:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:10:07,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:08,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488245506] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:08,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:08,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 46 [2025-03-08 23:10:08,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469595580] [2025-03-08 23:10:08,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:08,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 23:10:08,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:08,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 23:10:08,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2025, Unknown=1, NotChecked=90, Total=2256 [2025-03-08 23:10:08,077 INFO L87 Difference]: Start difference. First operand 96 states and 103 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), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:10:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:09,151 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2025-03-08 23:10:09,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 23:10:09,151 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), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2025-03-08 23:10:09,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:09,152 INFO L225 Difference]: With dead ends: 137 [2025-03-08 23:10:09,152 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 23:10:09,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=266, Invalid=3397, Unknown=1, NotChecked=118, Total=3782 [2025-03-08 23:10:09,153 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 150 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:09,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1436 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1681 Invalid, 0 Unknown, 135 Unchecked, 0.7s Time] [2025-03-08 23:10:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 23:10:09,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 123. [2025-03-08 23:10:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 95 states have (on average 1.305263157894737) internal successors, (124), 114 states have internal predecessors, (124), 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-08 23:10:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2025-03-08 23:10:09,160 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 46 [2025-03-08 23:10:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:09,160 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2025-03-08 23:10:09,160 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), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:10:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2025-03-08 23:10:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:10:09,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:09,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:09,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 23:10:09,361 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-08 23:10:09,361 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:10:09,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash 911954171, now seen corresponding path program 1 times [2025-03-08 23:10:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776829587] [2025-03-08 23:10:09,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:09,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:10:09,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:10:09,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:09,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:10,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:10,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776829587] [2025-03-08 23:10:10,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776829587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:10,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365379722] [2025-03-08 23:10:10,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:10,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:10,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:10,320 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-08 23:10:10,320 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-08 23:10:10,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:10:10,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:10:10,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:10,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:10,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-08 23:10:10,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:10,529 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-08 23:10:10,532 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-08 23:10:10,772 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:10,772 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-08 23:10:10,779 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-08 23:10:10,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:10:10,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:10:11,025 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:11,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-03-08 23:10:11,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:10:11,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 43 treesize of output 19 [2025-03-08 23:10:11,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:11,173 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-08 23:10:11,175 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 11 treesize of output 3 [2025-03-08 23:10:11,339 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|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) is different from true [2025-03-08 23:10:11,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:11,366 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 51 treesize of output 34 [2025-03-08 23:10:11,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:11,373 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 22 treesize of output 17 [2025-03-08 23:10:11,383 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:10:11,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:10:11,390 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-08 23:10:11,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2025-03-08 23:10:11,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 23:10:11,634 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-08 23:10:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:10:11,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:11,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365379722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:11,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:11,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 48 [2025-03-08 23:10:11,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831798802] [2025-03-08 23:10:11,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:11,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 23:10:11,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:11,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 23:10:11,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2805, Unknown=1, NotChecked=106, Total=3080 [2025-03-08 23:10:11,993 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 49 states, 45 states have (on average 1.711111111111111) internal successors, (77), 42 states have internal predecessors, (77), 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-08 23:10:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:13,732 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2025-03-08 23:10:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 23:10:13,732 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.711111111111111) internal successors, (77), 42 states have internal predecessors, (77), 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 46 [2025-03-08 23:10:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:13,733 INFO L225 Difference]: With dead ends: 139 [2025-03-08 23:10:13,733 INFO L226 Difference]: Without dead ends: 139 [2025-03-08 23:10:13,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=319, Invalid=4939, Unknown=2, NotChecked=142, Total=5402 [2025-03-08 23:10:13,734 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 134 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 2013 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:13,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1546 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2013 Invalid, 0 Unknown, 137 Unchecked, 0.9s Time] [2025-03-08 23:10:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-08 23:10:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 122. [2025-03-08 23:10:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.297872340425532) internal successors, (122), 113 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-08 23:10:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2025-03-08 23:10:13,737 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 46 [2025-03-08 23:10:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:13,737 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2025-03-08 23:10:13,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.711111111111111) internal successors, (77), 42 states have internal predecessors, (77), 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-08 23:10:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2025-03-08 23:10:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 23:10:13,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:13,737 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-08 23:10:13,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 23:10:13,937 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-08 23:10:13,938 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:10:13,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:13,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1139851003, now seen corresponding path program 2 times [2025-03-08 23:10:13,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:13,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478704869] [2025-03-08 23:10:13,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:10:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:13,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-08 23:10:13,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:10:13,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:10:13,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:14,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:14,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478704869] [2025-03-08 23:10:14,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478704869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:14,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401718978] [2025-03-08 23:10:14,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 23:10:14,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:14,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:14,803 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-08 23:10:14,804 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-08 23:10:14,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-08 23:10:14,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:10:14,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 23:10:14,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:14,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 128 conjuncts are in the unsatisfiable core [2025-03-08 23:10:14,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:14,966 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-08 23:10:15,135 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:15,135 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-08 23:10:15,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:10:15,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:10:15,305 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 23:10:15,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2025-03-08 23:10:15,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-08 23:10:15,464 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:10:15,464 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 64 treesize of output 31 [2025-03-08 23:10:15,468 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-08 23:10:15,472 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-08 23:10:15,610 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_10|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2025-03-08 23:10:15,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:15,642 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-08 23:10:15,642 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 72 treesize of output 55 [2025-03-08 23:10:15,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:15,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:15,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-03-08 23:10:15,667 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:10:15,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:10:16,104 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:10:16,104 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 66 treesize of output 29 [2025-03-08 23:10:16,107 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-08 23:10:16,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:10:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-08 23:10:16,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:16,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401718978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:16,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:16,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 53 [2025-03-08 23:10:16,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981690767] [2025-03-08 23:10:16,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:16,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-08 23:10:16,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:16,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-08 23:10:16,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3230, Unknown=1, NotChecked=114, Total=3540 [2025-03-08 23:10:16,675 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 53 states, 50 states have (on average 1.72) internal successors, (86), 46 states have internal predecessors, (86), 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-08 23:10:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:17,904 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2025-03-08 23:10:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 23:10:17,904 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.72) internal successors, (86), 46 states have internal predecessors, (86), 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 51 [2025-03-08 23:10:17,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:17,905 INFO L225 Difference]: With dead ends: 128 [2025-03-08 23:10:17,905 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 23:10:17,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=352, Invalid=5201, Unknown=1, NotChecked=146, Total=5700 [2025-03-08 23:10:17,906 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 82 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:17,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1584 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1441 Invalid, 0 Unknown, 124 Unchecked, 0.7s Time] [2025-03-08 23:10:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 23:10:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2025-03-08 23:10:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 97 states have (on average 1.288659793814433) internal successors, (125), 116 states have internal predecessors, (125), 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-08 23:10:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2025-03-08 23:10:17,909 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 51 [2025-03-08 23:10:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:17,909 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2025-03-08 23:10:17,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.72) internal successors, (86), 46 states have internal predecessors, (86), 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-08 23:10:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2025-03-08 23:10:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 23:10:17,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:17,909 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:17,916 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-08 23:10:18,110 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-08 23:10:18,110 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:10:18,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:18,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1405521977, now seen corresponding path program 1 times [2025-03-08 23:10:18,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:18,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548416120] [2025-03-08 23:10:18,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:18,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:18,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 23:10:18,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:10:18,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:18,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 23:10:18,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548416120] [2025-03-08 23:10:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548416120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:18,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:10:18,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 23:10:18,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783419036] [2025-03-08 23:10:18,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:18,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:10:18,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:18,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:10:18,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:10:18,262 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:10:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:18,404 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2025-03-08 23:10:18,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 23:10:18,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2025-03-08 23:10:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:18,405 INFO L225 Difference]: With dead ends: 130 [2025-03-08 23:10:18,405 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 23:10:18,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-08 23:10:18,405 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 42 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:18,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 475 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:10:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 23:10:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2025-03-08 23:10:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 116 states have internal predecessors, (126), 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-08 23:10:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2025-03-08 23:10:18,410 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 51 [2025-03-08 23:10:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:18,410 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2025-03-08 23:10:18,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:10:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2025-03-08 23:10:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 23:10:18,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:18,410 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:18,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 23:10:18,411 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:10:18,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1405521978, now seen corresponding path program 1 times [2025-03-08 23:10:18,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:18,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67593716] [2025-03-08 23:10:18,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:18,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:18,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 23:10:18,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:10:18,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:18,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:10:18,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:18,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67593716] [2025-03-08 23:10:18,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67593716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:18,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010057829] [2025-03-08 23:10:18,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:18,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:18,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:18,902 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-08 23:10:18,903 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-08 23:10:19,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 23:10:19,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:10:19,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:19,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:19,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 23:10:19,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:19,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:10:19,173 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-08 23:10:19,176 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-08 23:10:19,211 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_20|) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-03-08 23:10:19,254 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 23:10:19,254 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-08 23:10:19,256 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-08 23:10:19,303 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-08 23:10:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-08 23:10:19,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:19,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010057829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:19,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:19,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 26 [2025-03-08 23:10:19,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802992509] [2025-03-08 23:10:19,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:19,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 23:10:19,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:19,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 23:10:19,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=784, Unknown=1, NotChecked=56, Total=930 [2025-03-08 23:10:19,442 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 27 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 23:10:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:19,921 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2025-03-08 23:10:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 23:10:19,921 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2025-03-08 23:10:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:19,922 INFO L225 Difference]: With dead ends: 132 [2025-03-08 23:10:19,922 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 23:10:19,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=1193, Unknown=1, NotChecked=70, Total=1406 [2025-03-08 23:10:19,922 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 71 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:19,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 877 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 980 Invalid, 0 Unknown, 105 Unchecked, 0.3s Time] [2025-03-08 23:10:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 23:10:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2025-03-08 23:10:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.28) internal successors, (128), 118 states have internal predecessors, (128), 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-08 23:10:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2025-03-08 23:10:19,928 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 51 [2025-03-08 23:10:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:19,929 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2025-03-08 23:10:19,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 23:10:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2025-03-08 23:10:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 23:10:19,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:19,929 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:19,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 23:10:20,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-08 23:10:20,130 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:10:20,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash -248779094, now seen corresponding path program 1 times [2025-03-08 23:10:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:20,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923004418] [2025-03-08 23:10:20,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:20,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:20,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 23:10:20,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 23:10:20,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:20,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:20,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:20,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923004418] [2025-03-08 23:10:20,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923004418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:20,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036432188] [2025-03-08 23:10:20,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:20,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:20,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:20,797 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-08 23:10:20,798 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-08 23:10:20,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 23:10:20,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 23:10:20,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:20,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:20,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-03-08 23:10:20,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:21,007 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-08 23:10:21,090 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-08 23:10:21,153 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 23:10:21,153 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 17 treesize of output 21 [2025-03-08 23:10:21,235 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 25 treesize of output 13 [2025-03-08 23:10:21,286 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 18 treesize of output 13 [2025-03-08 23:10:21,421 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-08 23:10:21,423 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-08 23:10:21,545 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-08 23:10:21,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-08 23:10:21,551 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 26 treesize of output 21 [2025-03-08 23:10:21,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:21,760 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 45 treesize of output 21 [2025-03-08 23:10:21,807 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 26 treesize of output 21 [2025-03-08 23:10:21,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-08 23:10:21,850 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-08 23:10:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:21,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:24,073 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1908 Int) (v_ArrVal_1909 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| v_ArrVal_1908))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1909) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|))) is different from false [2025-03-08 23:10:24,090 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1908 Int) (v_ArrVal_1909 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| Int)) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_33| v_ArrVal_1908))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1909) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2025-03-08 23:10:24,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036432188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:24,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:24,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 51 [2025-03-08 23:10:24,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318777377] [2025-03-08 23:10:24,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:24,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-08 23:10:24,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:24,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-08 23:10:24,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3226, Unknown=30, NotChecked=230, Total=3660 [2025-03-08 23:10:24,185 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand has 51 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 43 states have internal predecessors, (91), 6 states have call successors, (6), 4 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-08 23:10:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:25,629 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2025-03-08 23:10:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 23:10:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 43 states have internal predecessors, (91), 6 states have call successors, (6), 4 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 55 [2025-03-08 23:10:25,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:25,630 INFO L225 Difference]: With dead ends: 127 [2025-03-08 23:10:25,630 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 23:10:25,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=395, Invalid=5903, Unknown=30, NotChecked=314, Total=6642 [2025-03-08 23:10:25,632 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 90 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:25,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1917 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 23:10:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 23:10:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-08 23:10:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.26) internal successors, (126), 118 states have internal predecessors, (126), 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-08 23:10:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2025-03-08 23:10:25,634 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 55 [2025-03-08 23:10:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:25,635 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2025-03-08 23:10:25,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 43 states have internal predecessors, (91), 6 states have call successors, (6), 4 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-08 23:10:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2025-03-08 23:10:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 23:10:25,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:25,635 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2025-03-08 23:10:25,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-08 23:10:25,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:25,836 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:10:25,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1963625750, now seen corresponding path program 3 times [2025-03-08 23:10:25,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:25,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778944880] [2025-03-08 23:10:25,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 23:10:25,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:25,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 4 equivalence classes. [2025-03-08 23:10:25,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 58 statements. [2025-03-08 23:10:25,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 23:10:25,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 23:10:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:25,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778944880] [2025-03-08 23:10:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778944880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:25,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013600683] [2025-03-08 23:10:25,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 23:10:25,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:25,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:25,902 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-08 23:10:25,904 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-08 23:10:26,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 4 equivalence classes. [2025-03-08 23:10:26,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 58 statements. [2025-03-08 23:10:26,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 23:10:26,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:26,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 23:10:26,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 23:10:26,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:10:26,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013600683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:10:26,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:10:26,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 23:10:26,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688090700] [2025-03-08 23:10:26,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:10:26,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:10:26,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:26,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:10:26,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:10:26,126 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 23:10:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:26,134 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-03-08 23:10:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:10:26,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2025-03-08 23:10:26,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:26,134 INFO L225 Difference]: With dead ends: 92 [2025-03-08 23:10:26,134 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 23:10:26,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:10:26,135 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:26,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:10:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 23:10:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-08 23:10:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:10:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2025-03-08 23:10:26,138 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 58 [2025-03-08 23:10:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:26,138 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2025-03-08 23:10:26,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 23:10:26,138 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2025-03-08 23:10:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 23:10:26,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:26,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:26,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 23:10:26,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:26,339 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:10:26,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:26,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2114837247, now seen corresponding path program 1 times [2025-03-08 23:10:26,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:26,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240942708] [2025-03-08 23:10:26,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:26,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:26,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 23:10:26,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 23:10:26,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:26,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:27,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:27,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240942708] [2025-03-08 23:10:27,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240942708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:27,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534602120] [2025-03-08 23:10:27,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:27,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:27,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:27,824 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:27,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 23:10:27,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 23:10:28,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 23:10:28,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:28,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:28,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 138 conjuncts are in the unsatisfiable core [2025-03-08 23:10:28,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:28,065 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-08 23:10:28,225 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-08 23:10:28,308 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:28,308 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-08 23:10:28,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:10:28,398 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 11 [2025-03-08 23:10:28,523 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-08 23:10:28,525 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-08 23:10:28,681 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 11 treesize of output 3 [2025-03-08 23:10:28,683 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 11 treesize of output 3 [2025-03-08 23:10:28,685 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-08 23:10:28,928 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 23:10:28,929 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 20 treesize of output 23 [2025-03-08 23:10:28,939 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 23:10:28,939 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-08 23:10:28,944 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 20 treesize of output 15 [2025-03-08 23:10:29,642 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:29,642 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:10:29,642 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 36 [2025-03-08 23:10:29,645 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 45 treesize of output 21 [2025-03-08 23:10:30,077 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-08 23:10:30,165 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 20 treesize of output 15 [2025-03-08 23:10:30,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 19 treesize of output 11 [2025-03-08 23:10:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:30,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:30,485 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2215 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2215) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-03-08 23:10:30,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2025-03-08 23:10:31,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534602120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:31,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:31,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 73 [2025-03-08 23:10:31,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146739068] [2025-03-08 23:10:31,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:31,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-08 23:10:31,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:31,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-08 23:10:31,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=7091, Unknown=26, NotChecked=170, Total=7656 [2025-03-08 23:10:31,554 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 73 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 64 states have internal predecessors, (102), 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-08 23:10:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:37,953 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2025-03-08 23:10:37,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 23:10:37,953 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 64 states have internal predecessors, (102), 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 60 [2025-03-08 23:10:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:37,954 INFO L225 Difference]: With dead ends: 96 [2025-03-08 23:10:37,954 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 23:10:37,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3208 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=732, Invalid=13051, Unknown=27, NotChecked=232, Total=14042 [2025-03-08 23:10:37,956 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 76 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 2052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:37,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1622 Invalid, 2052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 23:10:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 23:10:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-03-08 23:10:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.25) internal successors, (90), 86 states have internal predecessors, (90), 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-08 23:10:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2025-03-08 23:10:37,959 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 60 [2025-03-08 23:10:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:37,959 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2025-03-08 23:10:37,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 64 states have internal predecessors, (102), 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-08 23:10:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2025-03-08 23:10:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 23:10:37,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:37,959 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:37,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 23:10:38,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 23:10:38,160 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:10:38,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash 905863858, now seen corresponding path program 1 times [2025-03-08 23:10:38,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:38,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390090317] [2025-03-08 23:10:38,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:38,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:38,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 23:10:38,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 23:10:38,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:38,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:10:39,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390090317] [2025-03-08 23:10:39,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390090317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201030205] [2025-03-08 23:10:39,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:39,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:39,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:39,151 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:39,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 23:10:39,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 23:10:39,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 23:10:39,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:39,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:39,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-08 23:10:39,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:39,324 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-08 23:10:39,432 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 23:10:39,432 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 17 treesize of output 21 [2025-03-08 23:10:39,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:10:39,550 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:39,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-08 23:10:39,631 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 38 treesize of output 14 [2025-03-08 23:10:39,635 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-08 23:10:39,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:39,756 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 46 treesize of output 35 [2025-03-08 23:10:39,779 INFO L349 Elim1Store]: treesize reduction 84, result has 37.8 percent of original size [2025-03-08 23:10:39,779 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 38 treesize of output 65 [2025-03-08 23:10:39,971 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-03-08 23:10:39,972 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 65 treesize of output 56 [2025-03-08 23:10:40,093 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-08 23:10:40,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 88 [2025-03-08 23:10:40,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-08 23:10:40,242 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 104 [2025-03-08 23:10:40,246 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 103 treesize of output 75 [2025-03-08 23:10:40,406 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 51 [2025-03-08 23:10:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:10:40,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:40,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2370 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2370) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-03-08 23:10:44,679 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_2370 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2370) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-03-08 23:10:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201030205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:44,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:44,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 52 [2025-03-08 23:10:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161755989] [2025-03-08 23:10:44,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:44,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-08 23:10:44,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:44,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-08 23:10:44,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2972, Unknown=30, NotChecked=222, Total=3422 [2025-03-08 23:10:44,882 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 53 states, 50 states have (on average 2.06) internal successors, (103), 46 states have internal predecessors, (103), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:10:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:46,062 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2025-03-08 23:10:46,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 23:10:46,063 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 2.06) internal successors, (103), 46 states have internal predecessors, (103), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 62 [2025-03-08 23:10:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:46,063 INFO L225 Difference]: With dead ends: 100 [2025-03-08 23:10:46,063 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 23:10:46,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=397, Invalid=4692, Unknown=31, NotChecked=282, Total=5402 [2025-03-08 23:10:46,064 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 64 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:46,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1278 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 23:10:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 23:10:46,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2025-03-08 23:10:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.263157894736842) internal successors, (96), 90 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:10:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2025-03-08 23:10:46,066 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 62 [2025-03-08 23:10:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:46,066 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2025-03-08 23:10:46,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 2.06) internal successors, (103), 46 states have internal predecessors, (103), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:10:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2025-03-08 23:10:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 23:10:46,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:46,067 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:46,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 23:10:46,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:46,268 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:10:46,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash 905863859, now seen corresponding path program 1 times [2025-03-08 23:10:46,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:46,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635590413] [2025-03-08 23:10:46,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:46,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:46,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 23:10:46,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 23:10:46,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:46,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:47,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635590413] [2025-03-08 23:10:47,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635590413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875192976] [2025-03-08 23:10:48,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:48,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:48,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:48,001 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:48,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 23:10:48,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 23:10:48,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 23:10:48,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:48,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:48,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-03-08 23:10:48,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:48,180 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-08 23:10:48,185 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-08 23:10:48,406 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:48,406 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-08 23:10:48,410 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-08 23:10:48,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:10:48,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:10:48,586 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:48,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-03-08 23:10:48,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:10:48,735 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 43 treesize of output 19 [2025-03-08 23:10:48,738 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-08 23:10:48,740 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-08 23:10:48,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:10:49,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:10:49,038 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 51 treesize of output 34 [2025-03-08 23:10:49,050 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-08 23:10:49,051 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 22 treesize of output 29 [2025-03-08 23:10:49,073 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:10:49,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:10:49,083 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-08 23:10:49,415 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2025-03-08 23:10:49,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2025-03-08 23:10:49,425 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2025-03-08 23:10:49,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2025-03-08 23:10:49,583 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-08 23:10:49,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 79 [2025-03-08 23:10:49,598 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-08 23:10:49,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 106 [2025-03-08 23:10:49,645 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-08 23:10:49,659 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-08 23:10:49,670 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 23:10:49,842 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 130 treesize of output 82 [2025-03-08 23:10:50,096 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 51 [2025-03-08 23:10:50,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 23:10:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:10:50,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:50,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2528 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2528) .cse0) .cse1) 4))) (forall ((v_ArrVal_2528 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2528) .cse0) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2529) .cse0) .cse1)))))) is different from false [2025-03-08 23:10:51,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875192976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:51,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:51,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 28] total 60 [2025-03-08 23:10:51,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943427527] [2025-03-08 23:10:51,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:51,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-08 23:10:51,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:51,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-08 23:10:51,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=4429, Unknown=39, NotChecked=134, Total=4830 [2025-03-08 23:10:51,514 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 61 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 52 states have internal predecessors, (108), 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-08 23:10:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:54,002 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2025-03-08 23:10:54,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 23:10:54,003 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 52 states have internal predecessors, (108), 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 62 [2025-03-08 23:10:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:54,003 INFO L225 Difference]: With dead ends: 102 [2025-03-08 23:10:54,003 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 23:10:54,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1835 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=456, Invalid=8438, Unknown=40, NotChecked=186, Total=9120 [2025-03-08 23:10:54,004 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 77 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:54,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1601 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 23:10:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 23:10:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-03-08 23:10:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 92 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:10:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2025-03-08 23:10:54,006 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 62 [2025-03-08 23:10:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:54,006 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2025-03-08 23:10:54,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 58 states have (on average 1.8620689655172413) internal successors, (108), 52 states have internal predecessors, (108), 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-08 23:10:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2025-03-08 23:10:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 23:10:54,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:54,008 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:54,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 23:10:54,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:54,208 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:10:54,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1311158469, now seen corresponding path program 1 times [2025-03-08 23:10:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:54,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599833984] [2025-03-08 23:10:54,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:54,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:54,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 23:10:54,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 23:10:54,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:54,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:55,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:55,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599833984] [2025-03-08 23:10:55,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599833984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:55,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709051070] [2025-03-08 23:10:55,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:55,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:55,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:10:55,134 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:10:55,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 23:10:55,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 23:10:55,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 23:10:55,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:55,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:55,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-08 23:10:55,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:10:55,304 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-08 23:10:55,346 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:10:55,346 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-08 23:10:55,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:10:55,432 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:10:55,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-08 23:10:55,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-03-08 23:10:55,466 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-08 23:10:55,508 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 23:10:55,508 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-08 23:10:55,510 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 29 treesize of output 24 [2025-03-08 23:10:55,577 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-03-08 23:10:55,578 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 32 treesize of output 47 [2025-03-08 23:10:55,631 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2025-03-08 23:10:55,631 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 57 [2025-03-08 23:10:55,635 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 10 treesize of output 8 [2025-03-08 23:10:55,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-03-08 23:10:55,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-03-08 23:10:55,698 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-08 23:10:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:10:55,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:10:55,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2685 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2685) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))) is different from false [2025-03-08 23:10:55,794 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_2685 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2685) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0)))) is different from false [2025-03-08 23:10:55,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709051070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:55,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:10:55,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29] total 44 [2025-03-08 23:10:55,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853408420] [2025-03-08 23:10:55,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:10:55,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-08 23:10:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:10:55,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-08 23:10:55,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1920, Unknown=14, NotChecked=178, Total=2256 [2025-03-08 23:10:55,866 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 44 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 37 states have internal predecessors, (93), 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-08 23:10:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:10:56,495 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2025-03-08 23:10:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 23:10:56,496 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 37 states have internal predecessors, (93), 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 65 [2025-03-08 23:10:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:10:56,496 INFO L225 Difference]: With dead ends: 102 [2025-03-08 23:10:56,496 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 23:10:56,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=248, Invalid=3168, Unknown=14, NotChecked=230, Total=3660 [2025-03-08 23:10:56,497 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 81 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:10:56,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1130 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:10:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 23:10:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-03-08 23:10:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 92 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:10:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2025-03-08 23:10:56,499 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 65 [2025-03-08 23:10:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:10:56,499 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2025-03-08 23:10:56,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 37 states have internal predecessors, (93), 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-08 23:10:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2025-03-08 23:10:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 23:10:56,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:10:56,500 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:10:56,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 23:10:56,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:56,701 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-03-08 23:10:56,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:10:56,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1976818851, now seen corresponding path program 1 times [2025-03-08 23:10:56,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:10:56,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904060183] [2025-03-08 23:10:56,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:56,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:10:56,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 23:10:56,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 23:10:56,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:10:56,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:10:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:10:59,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:10:59,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904060183] [2025-03-08 23:10:59,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904060183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:10:59,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635802299] [2025-03-08 23:10:59,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:10:59,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:10:59,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:11:00,001 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:11:00,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 23:11:00,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 23:11:00,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 23:11:00,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:11:00,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:11:00,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 161 conjuncts are in the unsatisfiable core [2025-03-08 23:11:00,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:11:00,256 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-08 23:11:00,267 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-08 23:11:00,539 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:11:00,539 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-08 23:11:00,547 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-08 23:11:00,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:11:00,667 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-08 23:11:00,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:11:00,826 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:11:00,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 75 [2025-03-08 23:11:00,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:11:00,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:11:00,835 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 39 treesize of output 15 [2025-03-08 23:11:01,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2025-03-08 23:11:01,065 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-08 23:11:01,067 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-08 23:11:01,070 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-08 23:11:01,404 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 23:11:01,404 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 20 treesize of output 23 [2025-03-08 23:11:01,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:11:01,419 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 53 treesize of output 36 [2025-03-08 23:11:01,429 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-08 23:11:01,429 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 24 treesize of output 31 [2025-03-08 23:11:01,446 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 23:11:01,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:11:02,457 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-08 23:11:02,457 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 82 [2025-03-08 23:11:02,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:11:02,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 55 treesize of output 19 [2025-03-08 23:11:02,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 15 [2025-03-08 23:11:02,585 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 52 treesize of output 35 [2025-03-08 23:11:02,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 19 [2025-03-08 23:11:02,593 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-08 23:11:02,696 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-08 23:11:02,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-08 23:11:02,845 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