./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_append_unequal.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/dll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:07:46,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:07:46,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:07:46,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:07:46,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:07:46,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:07:46,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:07:46,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:07:46,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:07:46,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:07:46,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:07:46,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:07:46,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:07:46,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:07:46,160 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:07:46,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:07:46,160 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:07:46,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:07:46,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:07:46,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:07:46,160 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:07:46,160 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:07:46,160 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:07:46,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:07:46,161 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:07:46,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:07:46,161 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:07:46,161 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:07:46,161 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:07:46,161 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:07:46,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:07:46,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:07:46,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:07:46,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:07:46,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:07:46,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:07:46,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:07:46,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:07:46,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:07:46,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:07:46,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:07:46,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:07:46,163 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2025-03-08 23:07:46,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:07:46,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:07:46,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:07:46,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:07:46,404 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:07:46,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2025-03-08 23:07:47,524 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327006c79/cb087640a744413ba47fa3859119508a/FLAG8e8d47b99 [2025-03-08 23:07:47,787 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:07:47,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2025-03-08 23:07:47,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327006c79/cb087640a744413ba47fa3859119508a/FLAG8e8d47b99 [2025-03-08 23:07:47,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327006c79/cb087640a744413ba47fa3859119508a [2025-03-08 23:07:47,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:07:47,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:07:47,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:07:47,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:07:47,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:07:47,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:07:47" (1/1) ... [2025-03-08 23:07:47,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2583efae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:47, skipping insertion in model container [2025-03-08 23:07:47,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:07:47" (1/1) ... [2025-03-08 23:07:47,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:07:48,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:07:48,066 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:07:48,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:07:48,126 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:07:48,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:48 WrapperNode [2025-03-08 23:07:48,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:07:48,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:07:48,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:07:48,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:07:48,133 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:07:48" (1/1) ... [2025-03-08 23:07:48,141 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:07:48" (1/1) ... [2025-03-08 23:07:48,154 INFO L138 Inliner]: procedures = 127, calls = 50, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 150 [2025-03-08 23:07:48,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:07:48,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:07:48,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:07:48,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:07:48,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:48" (1/1) ... [2025-03-08 23:07:48,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:48" (1/1) ... [2025-03-08 23:07:48,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:48" (1/1) ... [2025-03-08 23:07:48,182 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 20, 9]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2025-03-08 23:07:48,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:48" (1/1) ... [2025-03-08 23:07:48,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:48" (1/1) ... [2025-03-08 23:07:48,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:48" (1/1) ... [2025-03-08 23:07:48,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:48" (1/1) ... [2025-03-08 23:07:48,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:48" (1/1) ... [2025-03-08 23:07:48,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:48" (1/1) ... [2025-03-08 23:07:48,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:07:48,199 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:07:48,199 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:07:48,199 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:07:48,200 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:48" (1/1) ... [2025-03-08 23:07:48,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:07:48,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:07:48,222 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:07:48,224 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:07:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:07:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:07:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 23:07:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:07:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-08 23:07:48,242 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 23:07:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:07:48,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:07:48,340 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:07:48,341 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:07:48,596 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L629: 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:07:48,621 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:07:48,642 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-03-08 23:07:48,642 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:07:48,655 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:07:48,656 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:07:48,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:07:48 BoogieIcfgContainer [2025-03-08 23:07:48,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:07:48,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:07:48,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:07:48,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:07:48,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:07:47" (1/3) ... [2025-03-08 23:07:48,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158f4b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:07:48, skipping insertion in model container [2025-03-08 23:07:48,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:07:48" (2/3) ... [2025-03-08 23:07:48,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158f4b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:07:48, skipping insertion in model container [2025-03-08 23:07:48,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:07:48" (3/3) ... [2025-03-08 23:07:48,662 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2025-03-08 23:07:48,673 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:07:48,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_append_unequal.i that has 2 procedures, 141 locations, 1 initial locations, 3 loop locations, and 64 error locations. [2025-03-08 23:07:48,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:07:48,709 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;@546b46c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:07:48,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2025-03-08 23:07:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 136 states have internal predecessors, (148), 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:07:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:07:48,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:48,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:07:48,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:48,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:48,720 INFO L85 PathProgramCache]: Analyzing trace with hash 822748116, now seen corresponding path program 1 times [2025-03-08 23:07:48,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:48,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523139335] [2025-03-08 23:07:48,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:48,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:48,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:07:48,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:07:48,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:48,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:48,893 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:07:48,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:48,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523139335] [2025-03-08 23:07:48,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523139335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:07:48,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:07:48,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:07:48,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070480162] [2025-03-08 23:07:48,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:07:48,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:07:48,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:48,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:07:48,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:07:48,918 INFO L87 Difference]: Start difference. First operand has 141 states, 72 states have (on average 2.0555555555555554) internal successors, (148), 136 states have internal predecessors, (148), 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:07:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:49,046 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2025-03-08 23:07:49,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:07:49,047 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:07:49,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:49,051 INFO L225 Difference]: With dead ends: 137 [2025-03-08 23:07:49,051 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 23:07:49,052 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:07:49,053 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:49,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 216 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:07:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 23:07:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-08 23:07:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 129 states have internal predecessors, (137), 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:07:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2025-03-08 23:07:49,077 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 6 [2025-03-08 23:07:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:49,077 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2025-03-08 23:07:49,078 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:07:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2025-03-08 23:07:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:07:49,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:49,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:07:49,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:07:49,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:49,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 822748117, now seen corresponding path program 1 times [2025-03-08 23:07:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847595710] [2025-03-08 23:07:49,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:49,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:07:49,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:07:49,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:49,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:07:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:49,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847595710] [2025-03-08 23:07:49,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847595710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:07:49,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:07:49,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:07:49,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140573137] [2025-03-08 23:07:49,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:07:49,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:07:49,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:49,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:07:49,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:07:49,181 INFO L87 Difference]: Start difference. First operand 134 states and 143 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:07:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:49,246 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2025-03-08 23:07:49,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:07:49,246 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:07:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:49,247 INFO L225 Difference]: With dead ends: 131 [2025-03-08 23:07:49,247 INFO L226 Difference]: Without dead ends: 131 [2025-03-08 23:07:49,247 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:07:49,248 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 3 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:49,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 217 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:07:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-08 23:07:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-08 23:07:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 69 states have (on average 1.9420289855072463) internal successors, (134), 126 states have internal predecessors, (134), 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:07:49,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2025-03-08 23:07:49,254 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 6 [2025-03-08 23:07:49,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:49,254 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2025-03-08 23:07:49,254 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:07:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2025-03-08 23:07:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 23:07:49,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:49,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:49,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:07:49,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:49,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1199114954, now seen corresponding path program 1 times [2025-03-08 23:07:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:49,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480116965] [2025-03-08 23:07:49,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:49,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:49,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:07:49,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:07:49,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:49,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:49,335 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:07:49,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:49,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480116965] [2025-03-08 23:07:49,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480116965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:07:49,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:07:49,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:07:49,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280660986] [2025-03-08 23:07:49,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:07:49,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:07:49,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:49,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:07:49,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:07:49,336 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:07:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:49,348 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2025-03-08 23:07:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:07:49,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-08 23:07:49,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:49,350 INFO L225 Difference]: With dead ends: 142 [2025-03-08 23:07:49,350 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 23:07:49,350 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:07:49,350 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 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:07:49,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:07:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 23:07:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 132. [2025-03-08 23:07:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 70 states have (on average 1.9285714285714286) internal successors, (135), 127 states have internal predecessors, (135), 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:07:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-03-08 23:07:49,358 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 14 [2025-03-08 23:07:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:49,358 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-03-08 23:07:49,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 23:07:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-03-08 23:07:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 23:07:49,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:49,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:49,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:07:49,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:49,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:49,359 INFO L85 PathProgramCache]: Analyzing trace with hash -328009636, now seen corresponding path program 1 times [2025-03-08 23:07:49,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:49,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27121144] [2025-03-08 23:07:49,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:49,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:49,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 23:07:49,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 23:07:49,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:49,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:07:49,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27121144] [2025-03-08 23:07:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27121144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:07:49,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:07:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:07:49,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204901291] [2025-03-08 23:07:49,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:07:49,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:07:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:49,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:07:49,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:07:49,494 INFO L87 Difference]: Start difference. First operand 132 states and 141 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:07:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:49,688 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2025-03-08 23:07:49,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:07:49,688 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 24 [2025-03-08 23:07:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:49,689 INFO L225 Difference]: With dead ends: 131 [2025-03-08 23:07:49,690 INFO L226 Difference]: Without dead ends: 131 [2025-03-08 23:07:49,691 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:07:49,691 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 7 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:49,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 402 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:07:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-08 23:07:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-08 23:07:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.9142857142857144) internal successors, (134), 126 states have internal predecessors, (134), 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:07:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2025-03-08 23:07:49,702 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 24 [2025-03-08 23:07:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:49,702 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2025-03-08 23:07:49,705 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:07:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2025-03-08 23:07:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 23:07:49,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:49,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:49,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:07:49,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:49,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -328009635, now seen corresponding path program 1 times [2025-03-08 23:07:49,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:49,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459854868] [2025-03-08 23:07:49,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:49,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:49,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 23:07:49,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 23:07:49,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:49,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:07:49,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:49,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459854868] [2025-03-08 23:07:49,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459854868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:07:49,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:07:49,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:07:49,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022200100] [2025-03-08 23:07:49,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:07:49,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:07:49,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:49,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:07:49,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:07:49,895 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:07:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:50,048 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2025-03-08 23:07:50,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:07:50,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2025-03-08 23:07:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:50,050 INFO L225 Difference]: With dead ends: 130 [2025-03-08 23:07:50,050 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 23:07:50,050 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:07:50,050 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 6 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:50,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 426 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:07:50,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 23:07:50,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-08 23:07:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 70 states have (on average 1.9) internal successors, (133), 125 states have internal predecessors, (133), 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:07:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2025-03-08 23:07:50,055 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 24 [2025-03-08 23:07:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:50,055 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2025-03-08 23:07:50,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:07:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2025-03-08 23:07:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 23:07:50,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:50,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:50,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:07:50,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:50,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:50,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1684644359, now seen corresponding path program 1 times [2025-03-08 23:07:50,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:50,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203395211] [2025-03-08 23:07:50,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:50,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 23:07:50,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 23:07:50,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:50,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:07:50,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:50,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203395211] [2025-03-08 23:07:50,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203395211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:50,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560257894] [2025-03-08 23:07:50,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:50,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:07:50,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:07:50,315 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:07:50,317 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:07:50,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 23:07:50,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 23:07:50,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:50,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:50,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 23:07:50,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:07:50,437 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:07:50,493 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:07:50,494 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:07:50,539 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:07:50,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:07:50,799 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:07:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560257894] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:07:50,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:07:50,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-03-08 23:07:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052914133] [2025-03-08 23:07:50,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:07:50,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 23:07:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:50,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 23:07:50,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-08 23:07:50,801 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 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:07:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:51,271 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2025-03-08 23:07:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:07:51,272 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 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 26 [2025-03-08 23:07:51,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:51,273 INFO L225 Difference]: With dead ends: 135 [2025-03-08 23:07:51,273 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 23:07:51,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 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:07:51,274 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:51,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 886 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:07:51,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 23:07:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-08 23:07:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 74 states have (on average 1.8783783783783783) internal successors, (139), 129 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:07:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2025-03-08 23:07:51,278 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 26 [2025-03-08 23:07:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:51,279 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2025-03-08 23:07:51,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 13 states have internal predecessors, (38), 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:07:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2025-03-08 23:07:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 23:07:51,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:51,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:51,286 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:07:51,484 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:07:51,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:51,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:51,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1684644358, now seen corresponding path program 1 times [2025-03-08 23:07:51,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:51,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178299175] [2025-03-08 23:07:51,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:51,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:51,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 23:07:51,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 23:07:51,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:51,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:51,821 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:07:51,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:51,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178299175] [2025-03-08 23:07:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178299175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:51,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735398706] [2025-03-08 23:07:51,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:51,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:07:51,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:07:51,824 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:07:51,825 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:07:51,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 23:07:51,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 23:07:51,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:51,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:51,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 23:07:51,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:07:51,912 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:07:51,918 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:07:52,039 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 23:07:52,040 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:07:52,058 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:07:52,058 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:07:52,091 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:07:52,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:07:52,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735398706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:52,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:07:52,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2025-03-08 23:07:52,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26127557] [2025-03-08 23:07:52,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:07:52,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 23:07:52,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:52,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 23:07:52,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-08 23:07:52,208 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:07:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:52,632 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2025-03-08 23:07:52,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:07:52,633 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-08 23:07:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:52,633 INFO L225 Difference]: With dead ends: 135 [2025-03-08 23:07:52,634 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 23:07:52,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-08 23:07:52,634 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:52,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 641 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:07:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 23:07:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-08 23:07:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 74 states have (on average 1.864864864864865) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:07:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2025-03-08 23:07:52,642 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 26 [2025-03-08 23:07:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:52,642 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2025-03-08 23:07:52,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:07:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2025-03-08 23:07:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 23:07:52,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:52,643 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:52,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 23:07:52,843 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:07:52,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:52,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:52,844 INFO L85 PathProgramCache]: Analyzing trace with hash 259473896, now seen corresponding path program 1 times [2025-03-08 23:07:52,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:52,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691338118] [2025-03-08 23:07:52,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:52,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:52,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 23:07:52,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 23:07:52,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:52,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:07:52,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:52,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691338118] [2025-03-08 23:07:52,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691338118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:52,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293024153] [2025-03-08 23:07:52,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:52,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:07:52,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:07:52,916 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:07:52,917 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:07:52,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 23:07:52,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 23:07:52,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:52,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:53,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 23:07:53,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:07:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:07:53,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:07:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:07:53,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293024153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:07:53,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:07:53,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-08 23:07:53,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717384839] [2025-03-08 23:07:53,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:07:53,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:07:53,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:53,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:07:53,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:07:53,049 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:07:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:53,089 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2025-03-08 23:07:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:07:53,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-03-08 23:07:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:53,091 INFO L225 Difference]: With dead ends: 135 [2025-03-08 23:07:53,091 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 23:07:53,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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:07:53,092 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:53,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 629 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:07:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 23:07:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-08 23:07:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 129 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:07:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2025-03-08 23:07:53,100 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 28 [2025-03-08 23:07:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:53,101 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2025-03-08 23:07:53,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 23:07:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2025-03-08 23:07:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:07:53,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:53,101 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:53,108 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:07:53,306 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:07:53,306 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:53,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:53,307 INFO L85 PathProgramCache]: Analyzing trace with hash -547148519, now seen corresponding path program 1 times [2025-03-08 23:07:53,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:53,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686641635] [2025-03-08 23:07:53,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:53,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:53,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:07:53,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:07:53,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:53,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 23:07:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686641635] [2025-03-08 23:07:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686641635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:53,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858388011] [2025-03-08 23:07:53,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:53,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:07:53,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:07:53,364 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:07:53,365 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:07:53,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:07:53,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:07:53,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:53,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:53,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 23:07:53,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:07:53,457 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:07:53,496 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:07:53,526 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-08 23:07:53,526 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:07:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-03-08 23:07:53,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:07:53,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858388011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:53,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:07:53,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-03-08 23:07:53,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619356718] [2025-03-08 23:07:53,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:07:53,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:07:53,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:53,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:07:53,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-03-08 23:07:53,575 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 23:07:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:53,812 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2025-03-08 23:07:53,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:07:53,816 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2025-03-08 23:07:53,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:53,817 INFO L225 Difference]: With dead ends: 134 [2025-03-08 23:07:53,817 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 23:07:53,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-03-08 23:07:53,818 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 9 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:53,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 511 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 421 Invalid, 0 Unknown, 137 Unchecked, 0.2s Time] [2025-03-08 23:07:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 23:07:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-08 23:07:53,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 74 states have (on average 1.837837837837838) internal successors, (136), 128 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:07:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2025-03-08 23:07:53,823 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 29 [2025-03-08 23:07:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:53,823 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2025-03-08 23:07:53,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 23:07:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2025-03-08 23:07:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:07:53,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:53,824 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:53,832 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:07:54,024 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:07:54,025 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:54,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash -547148518, now seen corresponding path program 1 times [2025-03-08 23:07:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:54,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161360977] [2025-03-08 23:07:54,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:54,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:07:54,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:07:54,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:54,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:07:54,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:54,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161360977] [2025-03-08 23:07:54,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161360977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:54,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214528475] [2025-03-08 23:07:54,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:54,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:07:54,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:07:54,154 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:07:54,156 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:07:54,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:07:54,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:07:54,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:54,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:54,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 23:07:54,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:07:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:07:54,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:07:54,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:07:54,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2025-03-08 23:07:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:07:54,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214528475] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:07:54,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:07:54,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-08 23:07:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245323265] [2025-03-08 23:07:54,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:07:54,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 23:07:54,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:54,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 23:07:54,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:07:54,491 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 23:07:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:54,655 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2025-03-08 23:07:54,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:07:54,655 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2025-03-08 23:07:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:54,657 INFO L225 Difference]: With dead ends: 141 [2025-03-08 23:07:54,657 INFO L226 Difference]: Without dead ends: 141 [2025-03-08 23:07:54,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:07:54,657 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 9 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:54,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1213 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:07:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-08 23:07:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2025-03-08 23:07:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 77 states have (on average 1.8181818181818181) internal successors, (140), 131 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:07:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2025-03-08 23:07:54,660 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 29 [2025-03-08 23:07:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:54,661 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2025-03-08 23:07:54,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 23:07:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2025-03-08 23:07:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 23:07:54,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:54,661 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:54,670 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:07:54,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 23:07:54,862 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:54,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:54,863 INFO L85 PathProgramCache]: Analyzing trace with hash 218265186, now seen corresponding path program 1 times [2025-03-08 23:07:54,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:54,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707889587] [2025-03-08 23:07:54,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:54,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:54,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:07:54,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:07:54,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:54,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:07:54,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:54,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707889587] [2025-03-08 23:07:54,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707889587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:07:54,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:07:54,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:07:54,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859600253] [2025-03-08 23:07:54,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:07:54,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:07:54,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:54,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:07:54,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:07:54,936 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:07:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:55,097 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2025-03-08 23:07:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:07:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 30 [2025-03-08 23:07:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:55,099 INFO L225 Difference]: With dead ends: 136 [2025-03-08 23:07:55,099 INFO L226 Difference]: Without dead ends: 136 [2025-03-08 23:07:55,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:07:55,099 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 7 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:55,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 456 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:07:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-08 23:07:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-08 23:07:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 130 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:07:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2025-03-08 23:07:55,102 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 30 [2025-03-08 23:07:55,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:55,103 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2025-03-08 23:07:55,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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:07:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2025-03-08 23:07:55,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 23:07:55,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:55,103 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:55,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 23:07:55,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:55,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash 218265187, now seen corresponding path program 1 times [2025-03-08 23:07:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:55,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103784531] [2025-03-08 23:07:55,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:55,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 23:07:55,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 23:07:55,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:55,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:07:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:55,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103784531] [2025-03-08 23:07:55,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103784531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:07:55,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:07:55,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:07:55,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009802400] [2025-03-08 23:07:55,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:07:55,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:07:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:55,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:07:55,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:07:55,270 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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:07:55,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:55,435 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2025-03-08 23:07:55,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:07:55,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 30 [2025-03-08 23:07:55,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:55,436 INFO L225 Difference]: With dead ends: 135 [2025-03-08 23:07:55,436 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 23:07:55,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:07:55,437 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 6 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:55,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 481 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:07:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 23:07:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-08 23:07:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 77 states have (on average 1.7922077922077921) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 23:07:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2025-03-08 23:07:55,442 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 30 [2025-03-08 23:07:55,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:55,442 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2025-03-08 23:07:55,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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:07:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2025-03-08 23:07:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:07:55,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:55,443 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:55,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 23:07:55,443 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:55,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:55,443 INFO L85 PathProgramCache]: Analyzing trace with hash -49882788, now seen corresponding path program 1 times [2025-03-08 23:07:55,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:55,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786405644] [2025-03-08 23:07:55,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:55,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:07:55,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:07:55,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:55,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 23:07:55,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:55,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786405644] [2025-03-08 23:07:55,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786405644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:55,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241892004] [2025-03-08 23:07:55,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:55,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:07:55,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:07:55,516 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:07:55,518 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:07:55,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:07:55,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:07:55,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:55,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:55,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 23:07:55,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:07:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 23:07:55,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:07:55,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241892004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:07:55,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:07:55,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-08 23:07:55,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702854492] [2025-03-08 23:07:55,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:07:55,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:07:55,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:55,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:07:55,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:07:55,655 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:07:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:55,666 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2025-03-08 23:07:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:07:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-03-08 23:07:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:55,668 INFO L225 Difference]: With dead ends: 124 [2025-03-08 23:07:55,668 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 23:07:55,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:07:55,668 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:55,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:07:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 23:07:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-08 23:07:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 119 states have internal predecessors, (125), 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:07:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2025-03-08 23:07:55,671 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 41 [2025-03-08 23:07:55,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:55,672 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2025-03-08 23:07:55,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:07:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2025-03-08 23:07:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 23:07:55,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:55,674 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:55,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 23:07:55,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:07:55,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:55,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1120665025, now seen corresponding path program 1 times [2025-03-08 23:07:55,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:55,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90004608] [2025-03-08 23:07:55,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:55,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:55,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:07:55,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:07:55,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:55,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:07:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90004608] [2025-03-08 23:07:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90004608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527701832] [2025-03-08 23:07:56,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:56,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:07:56,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:07:56,224 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:07:56,226 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:07:56,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:07:56,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:07:56,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:56,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:56,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 23:07:56,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:07:56,356 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:07:56,362 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:07:56,369 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-03-08 23:07:56,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:07:56,398 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:07:56,410 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:07:56,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:07:56,448 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:07:56,466 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:07:56,486 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:07:56,486 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:07:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 14 not checked. [2025-03-08 23:07:56,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:07:56,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527701832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:56,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:07:56,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 14 [2025-03-08 23:07:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088683249] [2025-03-08 23:07:56,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:07:56,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 23:07:56,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:56,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 23:07:56,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=167, Unknown=2, NotChecked=54, Total=272 [2025-03-08 23:07:56,646 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 23:07:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:57,047 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2025-03-08 23:07:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:07:57,048 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2025-03-08 23:07:57,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:57,048 INFO L225 Difference]: With dead ends: 134 [2025-03-08 23:07:57,048 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 23:07:57,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=240, Unknown=2, NotChecked=66, Total=380 [2025-03-08 23:07:57,049 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 215 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:57,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 524 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 656 Invalid, 0 Unknown, 270 Unchecked, 0.3s Time] [2025-03-08 23:07:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 23:07:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2025-03-08 23:07:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 70 states have (on average 1.6714285714285715) internal successors, (117), 111 states have internal predecessors, (117), 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:07:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2025-03-08 23:07:57,051 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 43 [2025-03-08 23:07:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:57,052 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2025-03-08 23:07:57,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 23:07:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2025-03-08 23:07:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 23:07:57,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:57,052 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:57,059 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:07:57,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:07:57,253 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:57,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1120665024, now seen corresponding path program 1 times [2025-03-08 23:07:57,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:57,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130593649] [2025-03-08 23:07:57,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:57,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:07:57,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:07:57,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:57,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:07:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130593649] [2025-03-08 23:07:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130593649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709167293] [2025-03-08 23:07:57,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:57,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:07:57,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:07:57,772 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:07:57,773 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:07:57,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:07:57,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:07:57,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:57,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:57,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 23:07:57,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:07:57,916 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:07:57,932 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:07:57,937 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:07:57,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:07:57,992 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:07:58,007 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:07:58,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:07:58,047 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:07:58,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 23:07:58,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:07:58,154 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:07:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 23:07:58,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:07:58,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709167293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:07:58,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:07:58,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2025-03-08 23:07:58,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238606079] [2025-03-08 23:07:58,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:07:58,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:07:58,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:58,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:07:58,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2025-03-08 23:07:58,161 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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:07:58,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:58,281 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2025-03-08 23:07:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:07:58,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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 43 [2025-03-08 23:07:58,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:58,282 INFO L225 Difference]: With dead ends: 111 [2025-03-08 23:07:58,282 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 23:07:58,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=192, Unknown=1, NotChecked=28, Total=272 [2025-03-08 23:07:58,282 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 26 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:58,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 304 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 150 Unchecked, 0.1s Time] [2025-03-08 23:07:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 23:07:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-08 23:07:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 70 states have (on average 1.6) internal successors, (112), 106 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:07:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2025-03-08 23:07:58,284 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 43 [2025-03-08 23:07:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:58,285 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2025-03-08 23:07:58,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 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:07:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2025-03-08 23:07:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 23:07:58,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:58,285 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:58,292 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:07:58,490 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,SelfDestructingSolverStorable14 [2025-03-08 23:07:58,490 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:58,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:58,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1077703996, now seen corresponding path program 1 times [2025-03-08 23:07:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:58,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808742470] [2025-03-08 23:07:58,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:58,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:58,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 23:07:58,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 23:07:58,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:58,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 23:07:58,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:58,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808742470] [2025-03-08 23:07:58,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808742470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:07:58,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:07:58,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:07:58,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834193028] [2025-03-08 23:07:58,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:07:58,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:07:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:58,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:07:58,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:07:58,578 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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:07:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:58,698 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2025-03-08 23:07:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:07:58,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 45 [2025-03-08 23:07:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:58,699 INFO L225 Difference]: With dead ends: 107 [2025-03-08 23:07:58,699 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 23:07:58,700 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:07:58,700 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 19 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:58,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 309 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:07:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 23:07:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-08 23:07:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.542857142857143) internal successors, (108), 102 states have internal predecessors, (108), 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:07:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2025-03-08 23:07:58,702 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 45 [2025-03-08 23:07:58,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:58,703 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2025-03-08 23:07:58,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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:07:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2025-03-08 23:07:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 23:07:58,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:58,703 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:58,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 23:07:58,704 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:58,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1077703997, now seen corresponding path program 1 times [2025-03-08 23:07:58,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:58,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169589516] [2025-03-08 23:07:58,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:58,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 23:07:58,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 23:07:58,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:58,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 23:07:58,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:58,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169589516] [2025-03-08 23:07:58,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169589516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:58,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448890160] [2025-03-08 23:07:58,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:58,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:07:58,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:07:58,866 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:07:58,874 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:07:58,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 23:07:59,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 23:07:59,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:59,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:59,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 23:07:59,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:07:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 23:07:59,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:07:59,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448890160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:07:59,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:07:59,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-03-08 23:07:59,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035765823] [2025-03-08 23:07:59,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:07:59,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:07:59,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:07:59,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:07:59,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-08 23:07:59,092 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:07:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:07:59,197 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2025-03-08 23:07:59,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:07:59,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 45 [2025-03-08 23:07:59,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:07:59,198 INFO L225 Difference]: With dead ends: 103 [2025-03-08 23:07:59,198 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 23:07:59,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 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:07:59,199 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 21 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:07:59,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 348 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:07:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 23:07:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-08 23:07:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 98 states have internal predecessors, (104), 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:07:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2025-03-08 23:07:59,203 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 45 [2025-03-08 23:07:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:07:59,203 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2025-03-08 23:07:59,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:07:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2025-03-08 23:07:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:07:59,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:07:59,204 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:07:59,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 23:07:59,404 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,SelfDestructingSolverStorable16 [2025-03-08 23:07:59,404 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:07:59,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:07:59,404 INFO L85 PathProgramCache]: Analyzing trace with hash -950886640, now seen corresponding path program 1 times [2025-03-08 23:07:59,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:07:59,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716550543] [2025-03-08 23:07:59,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:59,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:07:59,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:07:59,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:07:59,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:59,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:07:59,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:07:59,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716550543] [2025-03-08 23:07:59,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716550543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:07:59,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578486266] [2025-03-08 23:07:59,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:07:59,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:07:59,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:07:59,658 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:07:59,660 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:07:59,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:07:59,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:07:59,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:07:59,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:07:59,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 23:07:59,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:07:59,954 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:07:59,961 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:07:59,991 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-08 23:07:59,991 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:08:00,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 23:08:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 23:08:00,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:08:00,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578486266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:08:00,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:08:00,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2025-03-08 23:08:00,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824600449] [2025-03-08 23:08:00,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:08:00,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:08:00,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:08:00,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:08:00,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=296, Unknown=1, NotChecked=34, Total=380 [2025-03-08 23:08:00,010 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:08:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:08:00,174 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2025-03-08 23:08:00,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 23:08:00,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2025-03-08 23:08:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:08:00,175 INFO L225 Difference]: With dead ends: 102 [2025-03-08 23:08:00,175 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 23:08:00,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=364, Unknown=1, NotChecked=38, Total=462 [2025-03-08 23:08:00,175 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 15 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:08:00,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 444 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 318 Invalid, 0 Unknown, 166 Unchecked, 0.1s Time] [2025-03-08 23:08:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 23:08:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-08 23:08:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 97 states have internal predecessors, (103), 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:08:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2025-03-08 23:08:00,177 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 46 [2025-03-08 23:08:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:08:00,177 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2025-03-08 23:08:00,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 23:08:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2025-03-08 23:08:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:08:00,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:08:00,178 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:08:00,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 23:08:00,378 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,SelfDestructingSolverStorable17 [2025-03-08 23:08:00,378 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:08:00,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:08:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash -950886639, now seen corresponding path program 1 times [2025-03-08 23:08:00,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:08:00,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136680121] [2025-03-08 23:08:00,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:00,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:08:00,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:08:00,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:08:00,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:00,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:08:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:08:00,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136680121] [2025-03-08 23:08:00,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136680121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:00,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089741028] [2025-03-08 23:08:00,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:00,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:00,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:08:00,782 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:08:00,784 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:08:00,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:08:00,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:08:00,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:00,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:00,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 23:08:00,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:08:00,964 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:08:01,175 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:08:01,180 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:08:01,211 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_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:08:01,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:08:01,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-08 23:08:01,247 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 23:08:01,248 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:08:01,305 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:08:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-03-08 23:08:01,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:08:01,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089741028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:01,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:08:01,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2025-03-08 23:08:01,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711448377] [2025-03-08 23:08:01,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:08:01,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 23:08:01,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:08:01,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 23:08:01,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=789, Unknown=1, NotChecked=56, Total=930 [2025-03-08 23:08:01,471 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 28 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 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:08:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:08:02,182 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2025-03-08 23:08:02,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 23:08:02,182 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 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 46 [2025-03-08 23:08:02,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:08:02,183 INFO L225 Difference]: With dead ends: 109 [2025-03-08 23:08:02,183 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 23:08:02,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=1486, Unknown=1, NotChecked=78, Total=1722 [2025-03-08 23:08:02,184 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 78 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 23:08:02,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1016 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1202 Invalid, 0 Unknown, 108 Unchecked, 0.5s Time] [2025-03-08 23:08:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 23:08:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-08 23:08:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 103 states have internal predecessors, (109), 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:08:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2025-03-08 23:08:02,187 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 46 [2025-03-08 23:08:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:08:02,187 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2025-03-08 23:08:02,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.88) internal successors, (72), 24 states have internal predecessors, (72), 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:08:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2025-03-08 23:08:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 23:08:02,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:08:02,187 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:08:02,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 23:08:02,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:02,388 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:08:02,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:08:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1025975405, now seen corresponding path program 1 times [2025-03-08 23:08:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:08:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357030895] [2025-03-08 23:08:02,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:08:02,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 23:08:02,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 23:08:02,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:02,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:08:03,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:08:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357030895] [2025-03-08 23:08:03,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357030895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232440534] [2025-03-08 23:08:03,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:03,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:03,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:08:03,180 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:08:03,181 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:08:03,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 23:08:03,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 23:08:03,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:03,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:03,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-08 23:08:03,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:08:03,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:08:03,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2025-03-08 23:08:03,871 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:08:03,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:08:03,995 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= 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|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) (exists ((|v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))) is different from true [2025-03-08 23:08:04,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:08:04,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-03-08 23:08:04,035 INFO L349 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2025-03-08 23:08:04,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2025-03-08 23:08:04,146 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:08:04,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 23:08:04,274 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 6 not checked. [2025-03-08 23:08:04,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:08:04,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232440534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:04,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:08:04,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2025-03-08 23:08:04,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7952118] [2025-03-08 23:08:04,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:08:04,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 23:08:04,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:08:04,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 23:08:04,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1670, Unknown=1, NotChecked=82, Total=1892 [2025-03-08 23:08:04,382 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 41 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:08:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:08:05,457 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2025-03-08 23:08:05,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 23:08:05,457 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2025-03-08 23:08:05,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:08:05,457 INFO L225 Difference]: With dead ends: 108 [2025-03-08 23:08:05,458 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 23:08:05,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=255, Invalid=2828, Unknown=1, NotChecked=108, Total=3192 [2025-03-08 23:08:05,458 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 23:08:05,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1337 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1498 Invalid, 0 Unknown, 111 Unchecked, 0.7s Time] [2025-03-08 23:08:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 23:08:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 23:08:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 102 states have internal predecessors, (108), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:08:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2025-03-08 23:08:05,461 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 48 [2025-03-08 23:08:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:08:05,461 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2025-03-08 23:08:05,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:08:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2025-03-08 23:08:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 23:08:05,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:08:05,461 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:08:05,471 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:08:05,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:05,662 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:08:05,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:08:05,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1025975406, now seen corresponding path program 1 times [2025-03-08 23:08:05,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:08:05,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468643112] [2025-03-08 23:08:05,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:05,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:08:05,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 23:08:05,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 23:08:05,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:05,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 23:08:06,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:08:06,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468643112] [2025-03-08 23:08:06,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468643112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:06,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584469252] [2025-03-08 23:08:06,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:06,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:06,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:08:06,701 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:08:06,702 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:08:06,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 23:08:07,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 23:08:07,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:07,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:07,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-08 23:08:07,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:08:07,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:08:07,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:08:07,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-08 23:08:07,810 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 11 [2025-03-08 23:08:07,814 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 23:08:07,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 23:08:07,974 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_dll_circular_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_circular_append_~head#1.base_BEFORE_CALL_7|) 0) 0))) is different from true [2025-03-08 23:08:07,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:08:08,000 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 45 treesize of output 34 [2025-03-08 23:08:08,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:08:08,005 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 32 treesize of output 27 [2025-03-08 23:08:08,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:08:08,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-03-08 23:08:08,019 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2025-03-08 23:08:08,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2025-03-08 23:08:08,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2025-03-08 23:08:08,136 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 23 treesize of output 15 [2025-03-08 23:08:08,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 23:08:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-03-08 23:08:08,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:08:08,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584469252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:08,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:08:08,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2025-03-08 23:08:08,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203436860] [2025-03-08 23:08:08,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:08:08,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 23:08:08,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:08:08,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 23:08:08,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2207, Unknown=1, NotChecked=94, Total=2450 [2025-03-08 23:08:08,458 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand has 45 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:08:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:08:09,972 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2025-03-08 23:08:09,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 23:08:09,972 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2025-03-08 23:08:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:08:09,973 INFO L225 Difference]: With dead ends: 107 [2025-03-08 23:08:09,973 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 23:08:09,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=293, Invalid=4266, Unknown=1, NotChecked=132, Total=4692 [2025-03-08 23:08:09,974 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 62 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 23:08:09,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1524 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1684 Invalid, 0 Unknown, 110 Unchecked, 0.8s Time] [2025-03-08 23:08:09,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 23:08:09,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-08 23:08:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 101 states have internal predecessors, (107), 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:08:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2025-03-08 23:08:09,978 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 48 [2025-03-08 23:08:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:08:09,978 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2025-03-08 23:08:09,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 23:08:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2025-03-08 23:08:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 23:08:09,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:08:09,978 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:08:09,987 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:08:10,178 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,SelfDestructingSolverStorable20 [2025-03-08 23:08:10,179 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:08:10,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:08:10,179 INFO L85 PathProgramCache]: Analyzing trace with hash 912127863, now seen corresponding path program 1 times [2025-03-08 23:08:10,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:08:10,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657824241] [2025-03-08 23:08:10,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:10,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:08:10,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 23:08:10,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 23:08:10,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:10,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 23:08:10,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:08:10,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657824241] [2025-03-08 23:08:10,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657824241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:10,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267535205] [2025-03-08 23:08:10,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:10,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:10,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:08:10,332 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:08:10,334 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:08:10,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 23:08:10,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 23:08:10,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:10,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:10,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 23:08:10,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:08:10,517 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:08:10,523 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:08:10,544 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:08:10,548 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:08:10,563 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-03-08 23:08:10,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:08:10,592 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:08:10,599 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:08:10,599 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:08:10,623 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:08:10,637 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:08:10,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:08:10,665 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:08:10,709 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:08:10,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:08:10,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-08 23:08:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 14 not checked. [2025-03-08 23:08:10,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:08:10,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267535205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:10,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:08:10,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2025-03-08 23:08:10,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216144402] [2025-03-08 23:08:10,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:08:10,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 23:08:10,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:08:10,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 23:08:10,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=233, Unknown=2, NotChecked=62, Total=342 [2025-03-08 23:08:10,868 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 17 states, 16 states have (on average 4.4375) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:08:10,881 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|)))) is different from true [2025-03-08 23:08:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:08:11,111 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2025-03-08 23:08:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 23:08:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2025-03-08 23:08:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:08:11,112 INFO L225 Difference]: With dead ends: 101 [2025-03-08 23:08:11,113 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 23:08:11,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=503, Unknown=4, NotChecked=144, Total=756 [2025-03-08 23:08:11,115 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 94 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:08:11,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 588 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 464 Invalid, 0 Unknown, 249 Unchecked, 0.2s Time] [2025-03-08 23:08:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 23:08:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 23:08:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 95 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:08:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2025-03-08 23:08:11,118 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 49 [2025-03-08 23:08:11,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:08:11,118 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2025-03-08 23:08:11,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.4375) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 23:08:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2025-03-08 23:08:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 23:08:11,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:08:11,118 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:08:11,128 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:08:11,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:11,322 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:08:11,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:08:11,322 INFO L85 PathProgramCache]: Analyzing trace with hash -473865146, now seen corresponding path program 1 times [2025-03-08 23:08:11,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:08:11,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180424234] [2025-03-08 23:08:11,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:11,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:08:11,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 23:08:11,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 23:08:11,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:11,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 23:08:11,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:08:11,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180424234] [2025-03-08 23:08:11,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180424234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:08:11,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:08:11,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:08:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890661908] [2025-03-08 23:08:11,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:08:11,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:08:11,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:08:11,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:08:11,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:08:11,387 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:08:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:08:11,447 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2025-03-08 23:08:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:08:11,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-03-08 23:08:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:08:11,449 INFO L225 Difference]: With dead ends: 100 [2025-03-08 23:08:11,449 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 23:08:11,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:08:11,450 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:08:11,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:08:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 23:08:11,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 23:08:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.337837837837838) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:08:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2025-03-08 23:08:11,453 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 54 [2025-03-08 23:08:11,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:08:11,453 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2025-03-08 23:08:11,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:08:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2025-03-08 23:08:11,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 23:08:11,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:08:11,454 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:08:11,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 23:08:11,455 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:08:11,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:08:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash -473865145, now seen corresponding path program 1 times [2025-03-08 23:08:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:08:11,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254809909] [2025-03-08 23:08:11,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:11,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:08:11,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 23:08:11,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 23:08:11,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:11,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:11,685 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 23:08:11,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:08:11,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254809909] [2025-03-08 23:08:11,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254809909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:11,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356955659] [2025-03-08 23:08:11,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:11,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:11,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:08:11,687 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:08:11,687 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:08:11,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 23:08:11,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 23:08:11,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:11,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:11,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 23:08:11,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:08:11,908 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 23 treesize of output 15 [2025-03-08 23:08:11,910 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 16 [2025-03-08 23:08:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 23:08:11,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:08:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356955659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:08:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:08:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 14 [2025-03-08 23:08:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740657023] [2025-03-08 23:08:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:08:11,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:08:11,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:08:11,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:08:11,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-08 23:08:11,923 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:08:11,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:08:11,980 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2025-03-08 23:08:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:08:11,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-03-08 23:08:11,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:08:11,981 INFO L225 Difference]: With dead ends: 99 [2025-03-08 23:08:11,981 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 23:08:11,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-08 23:08:11,982 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:08:11,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:08:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 23:08:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-08 23:08:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 93 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:08:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2025-03-08 23:08:11,984 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 54 [2025-03-08 23:08:11,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:08:11,984 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2025-03-08 23:08:11,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 23:08:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2025-03-08 23:08:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 23:08:11,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:08:11,985 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:08:11,994 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:08:12,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:12,186 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:08:12,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:08:12,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1812726634, now seen corresponding path program 1 times [2025-03-08 23:08:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:08:12,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703961628] [2025-03-08 23:08:12,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:12,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:08:12,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 23:08:12,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 23:08:12,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:12,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 23:08:12,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:08:12,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703961628] [2025-03-08 23:08:12,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703961628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:08:12,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:08:12,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 23:08:12,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787249250] [2025-03-08 23:08:12,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:08:12,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:08:12,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:08:12,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:08:12,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:08:12,321 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 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:08:12,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:08:12,434 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2025-03-08 23:08:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:08:12,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 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 59 [2025-03-08 23:08:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:08:12,435 INFO L225 Difference]: With dead ends: 103 [2025-03-08 23:08:12,435 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 23:08:12,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:08:12,435 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 37 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:08:12,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 392 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:08:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 23:08:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2025-03-08 23:08:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.32) internal successors, (99), 93 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:08:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2025-03-08 23:08:12,438 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 59 [2025-03-08 23:08:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:08:12,438 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2025-03-08 23:08:12,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 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:08:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2025-03-08 23:08:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 23:08:12,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:08:12,439 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:08:12,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 23:08:12,439 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:08:12,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:08:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1812726635, now seen corresponding path program 1 times [2025-03-08 23:08:12,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:08:12,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959500150] [2025-03-08 23:08:12,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:12,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:08:12,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 23:08:12,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 23:08:12,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:12,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:08:12,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:08:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959500150] [2025-03-08 23:08:12,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959500150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935710546] [2025-03-08 23:08:12,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:12,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:12,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:08:12,996 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:08:12,996 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:08:13,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 23:08:13,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 23:08:13,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:13,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:13,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 23:08:13,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:08:13,190 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:08:13,304 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:08:13,307 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:08:13,334 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_14|) 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:08:13,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:08:13,362 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:08:13,369 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 23:08:13,369 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:08:13,427 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:08:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-03-08 23:08:13,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:08:13,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935710546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:13,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:08:13,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 24 [2025-03-08 23:08:13,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689497996] [2025-03-08 23:08:13,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:08:13,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 23:08:13,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:08:13,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 23:08:13,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=678, Unknown=1, NotChecked=52, Total=812 [2025-03-08 23:08:13,608 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 25 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 21 states have internal predecessors, (81), 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:08:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:08:14,006 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2025-03-08 23:08:14,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 23:08:14,006 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 21 states have internal predecessors, (81), 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 59 [2025-03-08 23:08:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:08:14,007 INFO L225 Difference]: With dead ends: 105 [2025-03-08 23:08:14,007 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 23:08:14,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=1065, Unknown=1, NotChecked=66, Total=1260 [2025-03-08 23:08:14,007 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 56 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:08:14,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 658 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 767 Invalid, 0 Unknown, 103 Unchecked, 0.3s Time] [2025-03-08 23:08:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 23:08:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2025-03-08 23:08:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 95 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:08:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2025-03-08 23:08:14,010 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 59 [2025-03-08 23:08:14,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:08:14,011 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2025-03-08 23:08:14,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 21 states have internal predecessors, (81), 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:08:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2025-03-08 23:08:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 23:08:14,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:08:14,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:08:14,019 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:08:14,212 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,SelfDestructingSolverStorable25 [2025-03-08 23:08:14,212 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:08:14,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:08:14,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1237884560, now seen corresponding path program 1 times [2025-03-08 23:08:14,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:08:14,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454408738] [2025-03-08 23:08:14,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:14,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:08:14,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 23:08:14,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 23:08:14,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:14,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:08:15,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:08:15,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454408738] [2025-03-08 23:08:15,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454408738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:15,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286701164] [2025-03-08 23:08:15,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:15,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:15,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:08:15,975 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:08:15,976 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:08:16,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 23:08:16,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 23:08:16,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:16,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:16,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 139 conjuncts are in the unsatisfiable core [2025-03-08 23:08:16,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:08:16,252 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:08:16,395 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:08:16,461 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:08:16,461 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:08:16,545 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:08:16,605 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:08:16,710 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:08:16,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 23:08:16,768 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:08:16,932 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:08:16,937 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:08:16,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-08 23:08:17,186 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 23:08:17,187 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:08:17,203 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 23:08:17,203 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:08:17,219 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-08 23:08:17,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-08 23:08:17,481 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:08:17,481 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:08:17,482 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 29 treesize of output 7 [2025-03-08 23:08:17,616 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 27 treesize of output 15 [2025-03-08 23:08:17,678 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:08:17,702 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:08:17,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:08:17,831 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 43 treesize of output 15 [2025-03-08 23:08:17,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 23:08:18,012 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:08:18,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:08:18,318 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| Int) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3367 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3365)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| 4) v_ArrVal_3367))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |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_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15|))) is different from false [2025-03-08 23:08:18,347 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3367 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_3363) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3365)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| 4) v_ArrVal_3367))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset| (select v_ArrVal_3363 |c_ULTIMATE.start_dll_circular_append_~last~1#1.offset|)) v_ArrVal_3363)) (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15|))) is different from false [2025-03-08 23:08:18,358 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3367 Int)) (or (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.offset| (select v_ArrVal_3363 |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.offset|)) v_ArrVal_3363)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_3363) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3365)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| 4) v_ArrVal_3367))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |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_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15|))) is different from false [2025-03-08 23:08:18,369 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3367 Int)) (or (not (= v_ArrVal_3363 (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) .cse0 (select v_ArrVal_3363 .cse0))))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_3363) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3365)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| 4) v_ArrVal_3367))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |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_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15|))) is different from false [2025-03-08 23:08:18,381 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3367 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_3363) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_3365))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| 4) v_ArrVal_3367))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse1) (+ .cse3 4)))) (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) .cse2 (select v_ArrVal_3363 .cse2))) v_ArrVal_3363)) (< .cse3 |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15|)))) is different from false [2025-03-08 23:08:18,414 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3367 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_3363) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_3365))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| 4) v_ArrVal_3367))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| .cse1) (+ .cse3 4)))) (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) .cse2 (select v_ArrVal_3363 .cse2))) v_ArrVal_3363)) (< .cse3 |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15|)))) is different from false [2025-03-08 23:08:18,470 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3376 (Array Int Int)) (v_ArrVal_3377 (Array Int Int)) (v_ArrVal_3367 Int) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_26| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_3363) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_26| v_ArrVal_3365))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15| 4) v_ArrVal_3367))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_26|) 0)) (not (= (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_26| v_ArrVal_3376) .cse1) (+ .cse3 4)))) (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_26| v_ArrVal_3377) |ULTIMATE.start_dll_circular_append_~last~1#1.base|) .cse2 (select v_ArrVal_3363 .cse2))) v_ArrVal_3363)) (< .cse3 |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_15|)))) is different from false [2025-03-08 23:08:18,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286701164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:18,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 23:08:18,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 67 [2025-03-08 23:08:18,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946258700] [2025-03-08 23:08:18,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 23:08:18,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-08 23:08:18,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:08:18,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-08 23:08:18,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=4832, Unknown=7, NotChecked=1022, Total=6162 [2025-03-08 23:08:18,475 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 67 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 58 states have internal predecessors, (106), 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:08:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:08:20,196 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2025-03-08 23:08:20,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 23:08:20,197 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 58 states have internal predecessors, (106), 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 63 [2025-03-08 23:08:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:08:20,197 INFO L225 Difference]: With dead ends: 105 [2025-03-08 23:08:20,197 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 23:08:20,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=545, Invalid=8788, Unknown=7, NotChecked=1372, Total=10712 [2025-03-08 23:08:20,199 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 84 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 1916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 23:08:20,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1773 Invalid, 1916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 23:08:20,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 23:08:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2025-03-08 23:08:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 95 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:08:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2025-03-08 23:08:20,202 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 63 [2025-03-08 23:08:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:08:20,202 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2025-03-08 23:08:20,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 58 states have internal predecessors, (106), 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:08:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2025-03-08 23:08:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 23:08:20,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:08:20,202 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:08:20,211 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:08:20,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 23:08:20,403 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:08:20,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:08:20,403 INFO L85 PathProgramCache]: Analyzing trace with hash 282777781, now seen corresponding path program 1 times [2025-03-08 23:08:20,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:08:20,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803447940] [2025-03-08 23:08:20,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:20,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:08:20,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 23:08:20,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 23:08:20,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:20,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 23:08:20,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:08:20,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803447940] [2025-03-08 23:08:20,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803447940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:08:20,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:08:20,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:08:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023693271] [2025-03-08 23:08:20,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:08:20,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 23:08:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:08:20,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 23:08:20,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:08:20,535 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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:08:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:08:20,603 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2025-03-08 23:08:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:08:20,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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 64 [2025-03-08 23:08:20,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:08:20,605 INFO L225 Difference]: With dead ends: 100 [2025-03-08 23:08:20,605 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 23:08:20,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:08:20,606 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 19 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:08:20,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 234 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:08:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 23:08:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 23:08:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 23:08:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2025-03-08 23:08:20,609 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 64 [2025-03-08 23:08:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:08:20,609 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2025-03-08 23:08:20,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 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:08:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2025-03-08 23:08:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 23:08:20,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:08:20,609 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:08:20,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 23:08:20,610 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:08:20,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:08:20,610 INFO L85 PathProgramCache]: Analyzing trace with hash 282777782, now seen corresponding path program 1 times [2025-03-08 23:08:20,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:08:20,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822691737] [2025-03-08 23:08:20,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:20,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:08:20,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 23:08:20,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 23:08:20,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:20,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 23:08:20,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:08:20,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822691737] [2025-03-08 23:08:20,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822691737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:20,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027558629] [2025-03-08 23:08:20,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:20,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:20,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:08:20,933 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:08:20,935 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:08:21,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 23:08:21,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 23:08:21,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:21,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:21,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 23:08:21,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:08:21,346 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 23 treesize of output 15 [2025-03-08 23:08:21,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-08 23:08:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:08:21,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:08:21,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:08:21,407 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 33 treesize of output 37 [2025-03-08 23:08:21,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-08 23:08:21,504 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:08:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 23:08:21,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027558629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:08:21,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:08:21,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 36 [2025-03-08 23:08:21,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576257901] [2025-03-08 23:08:21,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:08:21,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 23:08:21,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:08:21,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 23:08:21,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1202, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 23:08:21,626 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 37 states, 36 states have (on average 3.8333333333333335) internal successors, (138), 34 states have internal predecessors, (138), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 23:08:25,644 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:08:29,656 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:08:33,669 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:08:37,701 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:08:41,714 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:08:45,737 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:08:49,751 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:08:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:08:50,187 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2025-03-08 23:08:50,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 23:08:50,187 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.8333333333333335) internal successors, (138), 34 states have internal predecessors, (138), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2025-03-08 23:08:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:08:50,188 INFO L225 Difference]: With dead ends: 99 [2025-03-08 23:08:50,188 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 23:08:50,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=1700, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 23:08:50,189 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 103 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:08:50,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1454 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1032 Invalid, 7 Unknown, 0 Unchecked, 28.4s Time] [2025-03-08 23:08:50,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 23:08:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-08 23:08:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 93 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:08:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2025-03-08 23:08:50,191 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 64 [2025-03-08 23:08:50,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:08:50,191 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2025-03-08 23:08:50,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.8333333333333335) internal successors, (138), 34 states have internal predecessors, (138), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 23:08:50,191 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2025-03-08 23:08:50,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 23:08:50,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:08:50,192 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:08:50,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-08 23:08:50,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 23:08:50,393 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 61 more)] === [2025-03-08 23:08:50,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:08:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1166508580, now seen corresponding path program 1 times [2025-03-08 23:08:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:08:50,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062506473] [2025-03-08 23:08:50,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:08:50,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 23:08:50,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 23:08:50,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:50,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:08:52,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:08:52,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062506473] [2025-03-08 23:08:52,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062506473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:08:52,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191436421] [2025-03-08 23:08:52,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:08:52,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:08:52,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:08:52,149 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:08:52,150 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:08:52,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 23:08:52,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 23:08:52,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:08:52,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:08:52,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-03-08 23:08:52,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:08:52,420 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:08:52,516 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:08:52,517 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:08:52,573 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:08:52,619 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:08:52,619 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 41 treesize of output 38 [2025-03-08 23:08:52,699 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:08:52,699 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:08:52,752 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 0 case distinctions, treesize of input 37 treesize of output 17 [2025-03-08 23:08:52,841 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:08:52,843 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:08:52,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:08:52,953 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:08:52,971 INFO L349 Elim1Store]: treesize reduction 84, result has 37.8 percent of original size [2025-03-08 23:08:52,972 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:08:53,143 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-03-08 23:08:53,144 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:08:53,272 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-08 23:08:53,273 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:08:53,292 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:08:53,393 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 97 treesize of output 74 [2025-03-08 23:08:53,538 INFO L349 Elim1Store]: treesize reduction 49, result has 43.0 percent of original size [2025-03-08 23:08:53,538 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 150 treesize of output 108 [2025-03-08 23:08:53,950 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 348 treesize of output 304 [2025-03-08 23:08:54,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:08:54,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 312 treesize of output 354 [2025-03-08 23:08:59,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:08:59,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 23 select indices, 23 select index equivalence classes, 0 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 253 case distinctions, treesize of input 807 treesize of output 3535