./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:17:02,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:17:02,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:17:02,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:17:02,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:17:02,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:17:02,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:17:02,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:17:02,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:17:02,439 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:17:02,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:17:02,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:17:02,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:17:02,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:17:02,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:17:02,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:17:02,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:17:02,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:17:02,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:17:02,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:17:02,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:17:02,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:17:02,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:17:02,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:17:02,441 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2025-03-17 12:17:02,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:17:02,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:17:02,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:17:02,699 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:17:02,699 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:17:02,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2025-03-17 12:17:03,846 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00379034e/1fc3aa569bc748d2bacce06b7e12d2f3/FLAG43d23e0d7 [2025-03-17 12:17:04,133 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:17:04,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2025-03-17 12:17:04,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00379034e/1fc3aa569bc748d2bacce06b7e12d2f3/FLAG43d23e0d7 [2025-03-17 12:17:04,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00379034e/1fc3aa569bc748d2bacce06b7e12d2f3 [2025-03-17 12:17:04,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:17:04,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:17:04,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:17:04,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:17:04,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:17:04,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221abf51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04, skipping insertion in model container [2025-03-17 12:17:04,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:17:04,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:17:04,434 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:17:04,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:17:04,507 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:17:04,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04 WrapperNode [2025-03-17 12:17:04,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:17:04,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:17:04,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:17:04,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:17:04,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,550 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2025-03-17 12:17:04,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:17:04,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:17:04,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:17:04,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:17:04,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,589 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 9, 14]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 10 writes are split as follows [0, 1, 9]. [2025-03-17 12:17:04,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:17:04,612 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:17:04,612 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:17:04,612 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:17:04,613 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (1/1) ... [2025-03-17 12:17:04,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:17:04,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:04,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:17:04,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-17 12:17:04,655 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:17:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 12:17:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:17:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:17:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 12:17:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:17:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 12:17:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 12:17:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 12:17:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:17:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:17:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 12:17:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:17:04,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:17:04,761 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:17:04,762 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:17:05,046 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-17 12:17:05,082 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-17 12:17:05,103 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2025-03-17 12:17:05,103 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:17:05,113 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:17:05,113 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:17:05,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:17:05 BoogieIcfgContainer [2025-03-17 12:17:05,113 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:17:05,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:17:05,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:17:05,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:17:05,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:17:04" (1/3) ... [2025-03-17 12:17:05,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88921b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:17:05, skipping insertion in model container [2025-03-17 12:17:05,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:17:04" (2/3) ... [2025-03-17 12:17:05,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88921b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:17:05, skipping insertion in model container [2025-03-17 12:17:05,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:17:05" (3/3) ... [2025-03-17 12:17:05,120 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2025-03-17 12:17:05,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:17:05,132 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_insert_equal.i that has 2 procedures, 122 locations, 1 initial locations, 4 loop locations, and 52 error locations. [2025-03-17 12:17:05,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:17:05,165 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;@28e7b630, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:17:05,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-03-17 12:17:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 117 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:17:05,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:05,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:17:05,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:05,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:05,176 INFO L85 PathProgramCache]: Analyzing trace with hash 146617358, now seen corresponding path program 1 times [2025-03-17 12:17:05,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:05,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364686800] [2025-03-17 12:17:05,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:05,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:17:05,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:17:05,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:05,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:17:05,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:05,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364686800] [2025-03-17 12:17:05,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364686800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:05,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:05,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:17:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932659695] [2025-03-17 12:17:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:05,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:17:05,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:05,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:17:05,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:17:05,371 INFO L87 Difference]: Start difference. First operand has 122 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 117 states have internal predecessors, (129), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:17:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:05,469 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2025-03-17 12:17:05,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:17:05,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-03-17 12:17:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:05,475 INFO L225 Difference]: With dead ends: 119 [2025-03-17 12:17:05,476 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 12:17:05,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:17:05,478 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:05,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 195 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:17:05,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 12:17:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-17 12:17:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.9193548387096775) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2025-03-17 12:17:05,508 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 5 [2025-03-17 12:17:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:05,508 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2025-03-17 12:17:05,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:17:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2025-03-17 12:17:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:17:05,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:05,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:17:05,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:17:05,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:05,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:05,509 INFO L85 PathProgramCache]: Analyzing trace with hash 146617359, now seen corresponding path program 1 times [2025-03-17 12:17:05,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:05,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004623043] [2025-03-17 12:17:05,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:05,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:05,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:17:05,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:17:05,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:05,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:17:05,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:05,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004623043] [2025-03-17 12:17:05,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004623043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:05,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:05,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:17:05,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973743518] [2025-03-17 12:17:05,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:05,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:17:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:05,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:17:05,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:17:05,613 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:17:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:05,702 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2025-03-17 12:17:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:17:05,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-03-17 12:17:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:05,703 INFO L225 Difference]: With dead ends: 114 [2025-03-17 12:17:05,703 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 12:17:05,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:17:05,704 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:05,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 196 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:17:05,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 12:17:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-17 12:17:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 62 states have (on average 1.8870967741935485) internal successors, (117), 109 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-17 12:17:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2025-03-17 12:17:05,710 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 5 [2025-03-17 12:17:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:05,710 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2025-03-17 12:17:05,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:17:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2025-03-17 12:17:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 12:17:05,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:05,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:05,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:17:05,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:05,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash 43803038, now seen corresponding path program 1 times [2025-03-17 12:17:05,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:05,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591918073] [2025-03-17 12:17:05,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:05,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 12:17:05,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 12:17:05,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:05,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:17:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591918073] [2025-03-17 12:17:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591918073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:05,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:05,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:17:05,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035090913] [2025-03-17 12:17:05,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:05,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:17:05,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:05,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:17:05,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:17:05,794 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:17:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:05,811 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2025-03-17 12:17:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:17:05,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-17 12:17:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:05,812 INFO L225 Difference]: With dead ends: 121 [2025-03-17 12:17:05,812 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 12:17:05,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:17:05,812 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 5 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 237 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-17 12:17:05,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 237 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:17:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 12:17:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2025-03-17 12:17:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.873015873015873) internal successors, (118), 110 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2025-03-17 12:17:05,824 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 12 [2025-03-17 12:17:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:05,824 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2025-03-17 12:17:05,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 12:17:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2025-03-17 12:17:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:17:05,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:05,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:05,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:17:05,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:05,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:05,825 INFO L85 PathProgramCache]: Analyzing trace with hash -272388472, now seen corresponding path program 1 times [2025-03-17 12:17:05,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:05,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676780621] [2025-03-17 12:17:05,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:05,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:05,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:17:05,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:17:05,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:05,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:17:05,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:05,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676780621] [2025-03-17 12:17:05,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676780621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:05,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:05,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:17:05,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521102766] [2025-03-17 12:17:05,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:05,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:17:05,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:05,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:17:05,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:17:05,970 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-17 12:17:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:06,125 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2025-03-17 12:17:06,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:17:06,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 21 [2025-03-17 12:17:06,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:06,126 INFO L225 Difference]: With dead ends: 114 [2025-03-17 12:17:06,128 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 12:17:06,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:17:06,128 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 2 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:06,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 371 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:17:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 12:17:06,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-17 12:17:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 109 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-17 12:17:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2025-03-17 12:17:06,136 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 21 [2025-03-17 12:17:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:06,136 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2025-03-17 12:17:06,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-17 12:17:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2025-03-17 12:17:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:17:06,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:06,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:06,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:17:06,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:06,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash -272388471, now seen corresponding path program 1 times [2025-03-17 12:17:06,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:06,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184426232] [2025-03-17 12:17:06,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:06,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:06,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:17:06,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:17:06,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:06,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:17:06,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:06,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184426232] [2025-03-17 12:17:06,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184426232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:06,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:06,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:17:06,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963410436] [2025-03-17 12:17:06,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:06,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:17:06,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:06,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:17:06,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:17:06,323 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-17 12:17:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:06,470 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2025-03-17 12:17:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:17:06,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 21 [2025-03-17 12:17:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:06,471 INFO L225 Difference]: With dead ends: 113 [2025-03-17 12:17:06,471 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 12:17:06,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:17:06,472 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:06,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 508 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:17:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 12:17:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 12:17:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 108 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2025-03-17 12:17:06,480 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 21 [2025-03-17 12:17:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:06,480 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2025-03-17 12:17:06,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-17 12:17:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2025-03-17 12:17:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:17:06,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:06,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:06,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:17:06,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:06,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:06,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1531664574, now seen corresponding path program 1 times [2025-03-17 12:17:06,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:06,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911214735] [2025-03-17 12:17:06,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:06,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:06,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:17:06,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:17:06,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:06,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:06,806 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-17 12:17:06,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:06,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911214735] [2025-03-17 12:17:06,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911214735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:06,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388128890] [2025-03-17 12:17:06,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:06,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:06,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:06,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:06,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:17:06,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:17:06,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:17:06,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:06,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:06,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 12:17:06,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:06,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:17:06,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-17 12:17:07,098 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:17:07,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:17:07,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:17:07,132 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-17 12:17:07,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:17:07,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388128890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:07,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:17:07,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2025-03-17 12:17:07,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109786539] [2025-03-17 12:17:07,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:17:07,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 12:17:07,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:07,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 12:17:07,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 12:17:07,259 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 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-17 12:17:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:07,551 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2025-03-17 12:17:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:17:07,551 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 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 24 [2025-03-17 12:17:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:07,552 INFO L225 Difference]: With dead ends: 114 [2025-03-17 12:17:07,552 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 12:17:07,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 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-17 12:17:07,553 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:07,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 471 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:17:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 12:17:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2025-03-17 12:17:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 107 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2025-03-17 12:17:07,564 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 24 [2025-03-17 12:17:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:07,564 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2025-03-17 12:17:07,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 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-17 12:17:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2025-03-17 12:17:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:17:07,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:07,564 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:07,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 12:17:07,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 12:17:07,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:07,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:07,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1531664575, now seen corresponding path program 1 times [2025-03-17 12:17:07,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:07,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574791452] [2025-03-17 12:17:07,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:07,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:07,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:17:07,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:17:07,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:07,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:17:07,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:07,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574791452] [2025-03-17 12:17:07,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574791452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:07,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488558465] [2025-03-17 12:17:07,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:07,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:07,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:07,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:07,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:17:08,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:17:08,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:17:08,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:08,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:08,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 12:17:08,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:08,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:17:08,085 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:17:08,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:17:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:17:08,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:17:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:17:08,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488558465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:17:08,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:17:08,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-03-17 12:17:08,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031814155] [2025-03-17 12:17:08,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:17:08,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:17:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:08,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:17:08,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-17 12:17:08,333 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 13 states have internal predecessors, (34), 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-17 12:17:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:08,636 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2025-03-17 12:17:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:17:08,636 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 13 states have internal predecessors, (34), 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 24 [2025-03-17 12:17:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:08,637 INFO L225 Difference]: With dead ends: 111 [2025-03-17 12:17:08,637 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 12:17:08,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 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-17 12:17:08,638 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:08,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 722 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:17:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 12:17:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 12:17:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 106 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2025-03-17 12:17:08,642 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 24 [2025-03-17 12:17:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:08,642 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2025-03-17 12:17:08,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 13 states have internal predecessors, (34), 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-17 12:17:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2025-03-17 12:17:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:17:08,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:08,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:08,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 12:17:08,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-17 12:17:08,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:08,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash 228118692, now seen corresponding path program 1 times [2025-03-17 12:17:08,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:08,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662853027] [2025-03-17 12:17:08,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:08,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:08,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:17:08,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:17:08,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:08,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:17:09,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662853027] [2025-03-17 12:17:09,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662853027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465641032] [2025-03-17 12:17:09,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:09,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:09,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:09,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:09,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:17:09,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:17:09,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:17:09,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:09,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:09,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 12:17:09,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:09,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:17:09,361 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-17 12:17:09,390 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:17:09,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 12:17:09,422 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:17:09,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:17:09,468 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-03-17 12:17:09,481 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:17:09,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:17:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2025-03-17 12:17:09,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:17:09,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465641032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:09,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:17:09,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2025-03-17 12:17:09,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251914283] [2025-03-17 12:17:09,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:17:09,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 12:17:09,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:09,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 12:17:09,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=379, Unknown=2, NotChecked=82, Total=552 [2025-03-17 12:17:09,800 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:17:10,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:10,195 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2025-03-17 12:17:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:17:10,195 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2025-03-17 12:17:10,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:10,196 INFO L225 Difference]: With dead ends: 122 [2025-03-17 12:17:10,196 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 12:17:10,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=486, Unknown=2, NotChecked=94, Total=702 [2025-03-17 12:17:10,196 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 209 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:10,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 473 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 549 Invalid, 0 Unknown, 250 Unchecked, 0.3s Time] [2025-03-17 12:17:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 12:17:10,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2025-03-17 12:17:10,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2025-03-17 12:17:10,206 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 35 [2025-03-17 12:17:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:10,206 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2025-03-17 12:17:10,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 15 states have internal predecessors, (50), 3 states have call successors, (5), 1 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:17:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2025-03-17 12:17:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:17:10,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:10,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:10,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 12:17:10,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:10,407 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:10,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:10,408 INFO L85 PathProgramCache]: Analyzing trace with hash 228118693, now seen corresponding path program 1 times [2025-03-17 12:17:10,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:10,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139421431] [2025-03-17 12:17:10,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:10,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:10,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:17:10,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:17:10,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:10,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:10,814 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:17:10,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:10,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139421431] [2025-03-17 12:17:10,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139421431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:10,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968100661] [2025-03-17 12:17:10,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:10,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:10,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:10,818 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:10,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:17:10,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:17:10,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:17:10,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:10,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:10,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 12:17:10,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:10,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:17:10,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:17:10,941 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-03-17 12:17:10,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:17:10,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:17:10,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:17:11,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:17:11,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:17:11,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:17:11,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:17:11,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:17:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 12:17:11,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:17:11,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968100661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:11,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:17:11,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 12:17:11,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357274860] [2025-03-17 12:17:11,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:11,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:17:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:11,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:17:11,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2025-03-17 12:17:11,123 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-17 12:17:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:11,223 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2025-03-17 12:17:11,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:17:11,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 35 [2025-03-17 12:17:11,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:11,224 INFO L225 Difference]: With dead ends: 99 [2025-03-17 12:17:11,224 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 12:17:11,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-03-17 12:17:11,225 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 33 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:11,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 246 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 135 Unchecked, 0.1s Time] [2025-03-17 12:17:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 12:17:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-03-17 12:17:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 93 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-03-17 12:17:11,227 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 35 [2025-03-17 12:17:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:11,228 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-03-17 12:17:11,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-17 12:17:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-03-17 12:17:11,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:17:11,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:11,229 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:11,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 12:17:11,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:11,429 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:11,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:11,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1245763522, now seen corresponding path program 1 times [2025-03-17 12:17:11,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:11,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360909883] [2025-03-17 12:17:11,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:11,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:11,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:17:11,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:17:11,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:11,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:17:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360909883] [2025-03-17 12:17:11,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360909883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271149763] [2025-03-17 12:17:11,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:11,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:11,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:11,692 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:11,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:17:11,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:17:11,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:17:11,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:11,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:11,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 12:17:11,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:11,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:17:11,954 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-17 12:17:11,984 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-17 12:17:11,984 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-17 12:17:11,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 12:17:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:17:11,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:17:11,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271149763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:11,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:17:11,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 18 [2025-03-17 12:17:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910027839] [2025-03-17 12:17:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:11,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:17:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:11,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:17:11,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=264, Unknown=1, NotChecked=32, Total=342 [2025-03-17 12:17:11,997 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-17 12:17:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:12,183 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2025-03-17 12:17:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:17:12,184 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 38 [2025-03-17 12:17:12,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:12,185 INFO L225 Difference]: With dead ends: 126 [2025-03-17 12:17:12,185 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 12:17:12,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=363, Unknown=1, NotChecked=38, Total=462 [2025-03-17 12:17:12,186 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 87 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:12,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 448 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 310 Invalid, 0 Unknown, 197 Unchecked, 0.1s Time] [2025-03-17 12:17:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 12:17:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 100. [2025-03-17 12:17:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 95 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2025-03-17 12:17:12,189 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 38 [2025-03-17 12:17:12,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:12,189 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2025-03-17 12:17:12,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-17 12:17:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2025-03-17 12:17:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 12:17:12,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:12,190 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:12,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 12:17:12,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 12:17:12,392 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:12,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:12,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1245763523, now seen corresponding path program 1 times [2025-03-17 12:17:12,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:12,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189411745] [2025-03-17 12:17:12,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:12,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:12,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:17:12,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:17:12,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:12,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:17:12,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:12,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189411745] [2025-03-17 12:17:12,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189411745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:12,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660588596] [2025-03-17 12:17:12,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:12,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:12,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:12,736 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:12,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:17:12,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 12:17:12,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 12:17:12,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:12,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:12,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-17 12:17:12,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:12,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:17:13,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:17:13,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:17:13,186 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_insert_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2025-03-17 12:17:13,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:17:13,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 12:17:13,242 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:17:13,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 12:17:13,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 12:17:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2025-03-17 12:17:13,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:17:13,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660588596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:13,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:17:13,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 25 [2025-03-17 12:17:13,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444431636] [2025-03-17 12:17:13,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:17:13,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 12:17:13,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:13,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 12:17:13,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=730, Unknown=1, NotChecked=54, Total=870 [2025-03-17 12:17:13,455 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 26 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 21 states have internal predecessors, (56), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:17:14,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:14,071 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2025-03-17 12:17:14,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 12:17:14,072 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 21 states have internal predecessors, (56), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2025-03-17 12:17:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:14,073 INFO L225 Difference]: With dead ends: 135 [2025-03-17 12:17:14,074 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 12:17:14,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=1401, Unknown=1, NotChecked=76, Total=1640 [2025-03-17 12:17:14,075 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 172 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:14,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 926 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 831 Invalid, 0 Unknown, 141 Unchecked, 0.4s Time] [2025-03-17 12:17:14,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 12:17:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 107. [2025-03-17 12:17:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2025-03-17 12:17:14,078 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 38 [2025-03-17 12:17:14,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:14,079 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2025-03-17 12:17:14,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 21 states have internal predecessors, (56), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-17 12:17:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2025-03-17 12:17:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 12:17:14,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:14,081 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:14,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 12:17:14,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:14,282 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:14,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash -36035577, now seen corresponding path program 1 times [2025-03-17 12:17:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:14,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363511718] [2025-03-17 12:17:14,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:14,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:14,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:17:14,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:17:14,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:14,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 12:17:14,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363511718] [2025-03-17 12:17:14,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363511718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:14,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:14,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:17:14,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720800073] [2025-03-17 12:17:14,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:14,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:17:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:14,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:17:14,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:17:14,328 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-17 12:17:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:14,336 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2025-03-17 12:17:14,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:17:14,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 39 [2025-03-17 12:17:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:14,337 INFO L225 Difference]: With dead ends: 108 [2025-03-17 12:17:14,338 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 12:17:14,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:17:14,338 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 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-17 12:17:14,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:17:14,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 12:17:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-17 12:17:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 102 states have internal predecessors, (111), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2025-03-17 12:17:14,341 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 39 [2025-03-17 12:17:14,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:14,342 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2025-03-17 12:17:14,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-17 12:17:14,342 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2025-03-17 12:17:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:17:14,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:14,343 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:14,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:17:14,343 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:14,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:14,345 INFO L85 PathProgramCache]: Analyzing trace with hash -271254178, now seen corresponding path program 1 times [2025-03-17 12:17:14,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:14,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021531765] [2025-03-17 12:17:14,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:14,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:14,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:17:14,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:17:14,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:14,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 12:17:14,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:14,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021531765] [2025-03-17 12:17:14,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021531765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:14,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:14,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:17:14,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345375558] [2025-03-17 12:17:14,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:14,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:17:14,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:14,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:17:14,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:17:14,439 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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-17 12:17:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:14,458 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2025-03-17 12:17:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:17:14,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 41 [2025-03-17 12:17:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:14,459 INFO L225 Difference]: With dead ends: 109 [2025-03-17 12:17:14,459 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 12:17:14,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:17:14,460 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 53 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:14,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 327 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:17:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 12:17:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2025-03-17 12:17:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 99 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-17 12:17:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2025-03-17 12:17:14,462 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 41 [2025-03-17 12:17:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:14,463 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2025-03-17 12:17:14,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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-17 12:17:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2025-03-17 12:17:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:17:14,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:14,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:14,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:17:14,463 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:14,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:14,464 INFO L85 PathProgramCache]: Analyzing trace with hash -270395364, now seen corresponding path program 1 times [2025-03-17 12:17:14,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:14,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941475901] [2025-03-17 12:17:14,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:14,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:17:14,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:17:14,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:14,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 12:17:14,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:14,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941475901] [2025-03-17 12:17:14,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941475901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:14,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:14,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:17:14,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573386672] [2025-03-17 12:17:14,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:14,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:17:14,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:14,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:17:14,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:17:14,529 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:17:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:14,623 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2025-03-17 12:17:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:17:14,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-03-17 12:17:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:14,624 INFO L225 Difference]: With dead ends: 102 [2025-03-17 12:17:14,624 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 12:17:14,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:17:14,624 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 18 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:14,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 287 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:17:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 12:17:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 12:17:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2025-03-17 12:17:14,627 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 41 [2025-03-17 12:17:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:14,627 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2025-03-17 12:17:14,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:17:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2025-03-17 12:17:14,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:17:14,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:14,629 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:14,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:17:14,629 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:14,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:14,629 INFO L85 PathProgramCache]: Analyzing trace with hash -270395363, now seen corresponding path program 1 times [2025-03-17 12:17:14,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:14,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002805770] [2025-03-17 12:17:14,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:14,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:14,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:17:14,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:17:14,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:14,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 12:17:14,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:14,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002805770] [2025-03-17 12:17:14,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002805770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:14,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:14,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:17:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541441270] [2025-03-17 12:17:14,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:14,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:17:14,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:14,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:17:14,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:17:14,696 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-17 12:17:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:14,710 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2025-03-17 12:17:14,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:17:14,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 41 [2025-03-17 12:17:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:14,711 INFO L225 Difference]: With dead ends: 105 [2025-03-17 12:17:14,711 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 12:17:14,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:17:14,711 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 52 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:14,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 226 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:17:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 12:17:14,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2025-03-17 12:17:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.457142857142857) internal successors, (102), 95 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2025-03-17 12:17:14,713 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 41 [2025-03-17 12:17:14,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:14,715 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2025-03-17 12:17:14,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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-17 12:17:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2025-03-17 12:17:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 12:17:14,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:14,719 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:14,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:17:14,719 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:14,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash 181055979, now seen corresponding path program 1 times [2025-03-17 12:17:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:14,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920426673] [2025-03-17 12:17:14,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:14,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:14,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 12:17:14,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:17:14,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:14,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 12:17:14,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:14,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920426673] [2025-03-17 12:17:14,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920426673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:14,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:14,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:17:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693450364] [2025-03-17 12:17:14,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:14,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:17:14,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:14,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:17:14,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:17:14,771 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-17 12:17:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:14,829 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2025-03-17 12:17:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:17:14,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 42 [2025-03-17 12:17:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:14,830 INFO L225 Difference]: With dead ends: 100 [2025-03-17 12:17:14,830 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 12:17:14,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:17:14,830 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 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-17 12:17:14,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:17:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 12:17:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-17 12:17:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 94 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-17 12:17:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2025-03-17 12:17:14,832 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 42 [2025-03-17 12:17:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:14,834 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2025-03-17 12:17:14,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-17 12:17:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2025-03-17 12:17:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 12:17:14,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:14,836 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:14,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:17:14,836 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:14,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash 181055980, now seen corresponding path program 1 times [2025-03-17 12:17:14,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:14,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131639215] [2025-03-17 12:17:14,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:14,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 12:17:14,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 12:17:14,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:14,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 12:17:14,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131639215] [2025-03-17 12:17:14,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131639215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:14,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:14,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:17:14,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498951430] [2025-03-17 12:17:14,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:14,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:17:14,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:14,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:17:14,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:17:14,933 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-17 12:17:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:14,991 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2025-03-17 12:17:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:17:14,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 42 [2025-03-17 12:17:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:14,992 INFO L225 Difference]: With dead ends: 99 [2025-03-17 12:17:14,992 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 12:17:14,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:17:14,993 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:14,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:17:14,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 12:17:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 12:17:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 93 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-17 12:17:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2025-03-17 12:17:14,995 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 42 [2025-03-17 12:17:14,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:14,995 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2025-03-17 12:17:14,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-17 12:17:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2025-03-17 12:17:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 12:17:14,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:14,996 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:14,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 12:17:14,996 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:14,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:14,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1317768088, now seen corresponding path program 1 times [2025-03-17 12:17:14,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:14,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031630762] [2025-03-17 12:17:14,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:14,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:15,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 12:17:15,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 12:17:15,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:15,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 12:17:15,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:15,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031630762] [2025-03-17 12:17:15,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031630762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:15,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:15,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:17:15,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579627183] [2025-03-17 12:17:15,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:15,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:17:15,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:15,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:17:15,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:17:15,106 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:17:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:15,194 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2025-03-17 12:17:15,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:17:15,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-03-17 12:17:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:15,195 INFO L225 Difference]: With dead ends: 96 [2025-03-17 12:17:15,195 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 12:17:15,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:17:15,195 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 13 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:15,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 295 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:17:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 12:17:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 12:17:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2025-03-17 12:17:15,198 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 43 [2025-03-17 12:17:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:15,198 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2025-03-17 12:17:15,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 12:17:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2025-03-17 12:17:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 12:17:15,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:15,198 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:15,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 12:17:15,199 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:15,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:15,199 INFO L85 PathProgramCache]: Analyzing trace with hash -640219659, now seen corresponding path program 1 times [2025-03-17 12:17:15,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:15,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957630640] [2025-03-17 12:17:15,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:15,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:15,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 12:17:15,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 12:17:15,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:15,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 12:17:15,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:15,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957630640] [2025-03-17 12:17:15,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957630640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:17:15,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:17:15,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:17:15,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233215920] [2025-03-17 12:17:15,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:17:15,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:17:15,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:15,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:17:15,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:17:15,317 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 6 states, 4 states have (on average 6.75) internal successors, (27), 6 states have internal predecessors, (27), 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-17 12:17:15,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:15,387 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2025-03-17 12:17:15,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:17:15,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 6 states have internal predecessors, (27), 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 45 [2025-03-17 12:17:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:15,388 INFO L225 Difference]: With dead ends: 94 [2025-03-17 12:17:15,388 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 12:17:15,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:17:15,388 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 78 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:15,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 241 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:17:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 12:17:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-03-17 12:17:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2025-03-17 12:17:15,392 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 45 [2025-03-17 12:17:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:15,392 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2025-03-17 12:17:15,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.75) internal successors, (27), 6 states have internal predecessors, (27), 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-17 12:17:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2025-03-17 12:17:15,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 12:17:15,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:15,393 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:15,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:17:15,393 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:15,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:15,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1070769008, now seen corresponding path program 1 times [2025-03-17 12:17:15,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:15,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248742421] [2025-03-17 12:17:15,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:15,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:15,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 12:17:15,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 12:17:15,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:15,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 12:17:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248742421] [2025-03-17 12:17:15,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248742421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744717132] [2025-03-17 12:17:15,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:15,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:15,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:15,530 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:15,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:17:15,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 12:17:15,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 12:17:15,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:15,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:15,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 12:17:15,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:15,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:17:15,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:17:15,783 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-17 12:17:15,784 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 18 treesize of output 21 [2025-03-17 12:17:15,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 12:17:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:17:15,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:17:16,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 12:17:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:17:16,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744717132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:17:16,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:17:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 22 [2025-03-17 12:17:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756798304] [2025-03-17 12:17:16,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:17:16,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 12:17:16,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:16,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 12:17:16,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-03-17 12:17:16,065 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 18 states have internal predecessors, (73), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:17:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:16,553 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2025-03-17 12:17:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:17:16,553 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 18 states have internal predecessors, (73), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2025-03-17 12:17:16,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:16,554 INFO L225 Difference]: With dead ends: 122 [2025-03-17 12:17:16,554 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 12:17:16,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2025-03-17 12:17:16,554 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 156 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:16,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 811 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 12:17:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 12:17:16,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 96. [2025-03-17 12:17:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 90 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-17 12:17:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2025-03-17 12:17:16,557 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 47 [2025-03-17 12:17:16,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:16,557 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2025-03-17 12:17:16,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 18 states have internal predecessors, (73), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 12:17:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2025-03-17 12:17:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 12:17:16,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:16,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:16,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 12:17:16,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:16,759 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:16,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1070769007, now seen corresponding path program 1 times [2025-03-17 12:17:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:16,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372784155] [2025-03-17 12:17:16,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:16,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 12:17:16,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 12:17:16,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:16,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:17:17,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:17,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372784155] [2025-03-17 12:17:17,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372784155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:17,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103851460] [2025-03-17 12:17:17,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:17,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:17,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:17,232 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:17,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 12:17:17,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 12:17:17,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 12:17:17,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:17,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:17,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 12:17:17,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:17,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:17:17,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:17:17,589 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-17 12:17:17,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 12:17:17,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 12:17:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:17:17,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:17:17,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103851460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:17,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:17:17,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2025-03-17 12:17:17,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158650539] [2025-03-17 12:17:17,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:17:17,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 12:17:17,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:17,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 12:17:17,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2025-03-17 12:17:17,897 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 23 states have internal predecessors, (70), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 12:17:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:18,643 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2025-03-17 12:17:18,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 12:17:18,643 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 23 states have internal predecessors, (70), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2025-03-17 12:17:18,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:18,643 INFO L225 Difference]: With dead ends: 120 [2025-03-17 12:17:18,644 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 12:17:18,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=201, Invalid=1779, Unknown=0, NotChecked=0, Total=1980 [2025-03-17 12:17:18,644 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 94 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:18,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1147 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 12:17:18,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 12:17:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 98. [2025-03-17 12:17:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 92 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2025-03-17 12:17:18,647 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 47 [2025-03-17 12:17:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:18,647 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2025-03-17 12:17:18,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 23 states have internal predecessors, (70), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 12:17:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2025-03-17 12:17:18,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 12:17:18,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:18,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:18,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 12:17:18,848 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,SelfDestructingSolverStorable20 [2025-03-17 12:17:18,848 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:18,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:18,848 INFO L85 PathProgramCache]: Analyzing trace with hash 5008636, now seen corresponding path program 1 times [2025-03-17 12:17:18,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:18,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134001389] [2025-03-17 12:17:18,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:18,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:18,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:17:18,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:17:18,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:18,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 12:17:18,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:18,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134001389] [2025-03-17 12:17:18,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134001389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:18,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777546172] [2025-03-17 12:17:18,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:18,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:18,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:18,941 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:18,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 12:17:19,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 12:17:19,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 12:17:19,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:19,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:19,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 12:17:19,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:19,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:17:19,114 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2025-03-17 12:17:19,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:17:19,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:17:19,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:17:19,222 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:17:19,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 12:17:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 12:17:19,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:17:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 12:17:19,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777546172] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:17:19,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:17:19,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2025-03-17 12:17:19,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484372223] [2025-03-17 12:17:19,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:17:19,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:17:19,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:19,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:17:19,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=280, Unknown=1, NotChecked=34, Total=380 [2025-03-17 12:17:19,486 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 20 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 12:17:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:19,686 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2025-03-17 12:17:19,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:17:19,688 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 48 [2025-03-17 12:17:19,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:19,688 INFO L225 Difference]: With dead ends: 83 [2025-03-17 12:17:19,688 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 12:17:19,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=472, Unknown=9, NotChecked=46, Total=650 [2025-03-17 12:17:19,690 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 61 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:19,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 514 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 396 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2025-03-17 12:17:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 12:17:19,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-17 12:17:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 77 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:17:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2025-03-17 12:17:19,692 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 48 [2025-03-17 12:17:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:19,692 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2025-03-17 12:17:19,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.9) internal successors, (78), 19 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-17 12:17:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2025-03-17 12:17:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 12:17:19,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:19,692 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:19,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 12:17:19,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:19,897 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:19,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:19,897 INFO L85 PathProgramCache]: Analyzing trace with hash -99174527, now seen corresponding path program 1 times [2025-03-17 12:17:19,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:19,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675977417] [2025-03-17 12:17:19,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:19,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:17:19,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:17:19,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:19,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:17:21,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:21,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675977417] [2025-03-17 12:17:21,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675977417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:21,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084829538] [2025-03-17 12:17:21,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:21,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:21,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:21,083 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:21,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 12:17:21,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 12:17:21,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 12:17:21,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:21,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:21,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-03-17 12:17:21,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:21,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:17:21,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:17:21,617 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:17:21,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:17:21,683 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-17 12:17:21,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:17:21,849 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-17 12:17:21,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:17:22,044 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-17 12:17:22,044 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-17 12:17:22,059 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:17:22,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 12:17:22,389 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-17 12:17:22,456 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-17 12:17:22,527 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-17 12:17:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:17:22,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:17:22,711 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1740 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1740) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-03-17 12:17:23,001 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1739 Int) (v_ArrVal_1740 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#2| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_1739)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1740) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-03-17 12:17:23,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084829538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:23,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:17:23,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 59 [2025-03-17 12:17:23,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246048451] [2025-03-17 12:17:23,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:17:23,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-17 12:17:23,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:23,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-17 12:17:23,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4118, Unknown=66, NotChecked=262, Total=4692 [2025-03-17 12:17:23,092 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 59 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 49 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:17:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:24,277 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2025-03-17 12:17:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 12:17:24,277 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 49 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2025-03-17 12:17:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:24,278 INFO L225 Difference]: With dead ends: 130 [2025-03-17 12:17:24,278 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 12:17:24,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2014 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=476, Invalid=7298, Unknown=66, NotChecked=350, Total=8190 [2025-03-17 12:17:24,280 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 71 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:24,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1530 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 12:17:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 12:17:24,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2025-03-17 12:17:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 104 states have internal predecessors, (111), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:17:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2025-03-17 12:17:24,283 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 51 [2025-03-17 12:17:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:24,283 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2025-03-17 12:17:24,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 49 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 12:17:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2025-03-17 12:17:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 12:17:24,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:24,283 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:24,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 12:17:24,483 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,SelfDestructingSolverStorable22 [2025-03-17 12:17:24,484 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:24,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash -750639436, now seen corresponding path program 1 times [2025-03-17 12:17:24,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:24,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194291432] [2025-03-17 12:17:24,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:24,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:24,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:17:24,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:17:24,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:24,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:17:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194291432] [2025-03-17 12:17:25,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194291432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644606969] [2025-03-17 12:17:25,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:25,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:25,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:25,032 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:25,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 12:17:25,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:17:25,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:17:25,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:25,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:25,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-17 12:17:25,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:25,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:17:25,280 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:17:25,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:17:25,331 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-17 12:17:25,399 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:17:25,400 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-17 12:17:25,476 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-17 12:17:25,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:17:25,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:17:25,618 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-17 12:17:25,637 INFO L349 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2025-03-17 12:17:25,637 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 40 treesize of output 60 [2025-03-17 12:17:25,791 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2025-03-17 12:17:25,792 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-17 12:17:25,904 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-17 12:17:25,904 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-17 12:17:25,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 5 treesize of output 3 [2025-03-17 12:17:26,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 104 [2025-03-17 12:17:26,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 75 [2025-03-17 12:17:26,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 51 [2025-03-17 12:17:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:17:26,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:17:26,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644606969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:26,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:17:26,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 43 [2025-03-17 12:17:26,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680906771] [2025-03-17 12:17:26,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:17:26,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-17 12:17:26,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:26,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-17 12:17:26,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2122, Unknown=1, NotChecked=0, Total=2256 [2025-03-17 12:17:26,702 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 44 states, 41 states have (on average 2.097560975609756) internal successors, (86), 37 states have internal predecessors, (86), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:17:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:28,315 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2025-03-17 12:17:28,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 12:17:28,316 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.097560975609756) internal successors, (86), 37 states have internal predecessors, (86), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2025-03-17 12:17:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:28,316 INFO L225 Difference]: With dead ends: 152 [2025-03-17 12:17:28,316 INFO L226 Difference]: Without dead ends: 152 [2025-03-17 12:17:28,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=448, Invalid=6193, Unknown=1, NotChecked=0, Total=6642 [2025-03-17 12:17:28,318 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 199 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:28,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1174 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 12:17:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-17 12:17:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2025-03-17 12:17:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 108 states have internal predecessors, (117), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:17:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2025-03-17 12:17:28,322 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 53 [2025-03-17 12:17:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:28,323 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2025-03-17 12:17:28,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.097560975609756) internal successors, (86), 37 states have internal predecessors, (86), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:17:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2025-03-17 12:17:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 12:17:28,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:28,323 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:28,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 12:17:28,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 12:17:28,527 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:28,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:28,527 INFO L85 PathProgramCache]: Analyzing trace with hash -750639435, now seen corresponding path program 1 times [2025-03-17 12:17:28,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:28,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981025385] [2025-03-17 12:17:28,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:28,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:28,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:17:28,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:17:28,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:28,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:17:29,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:29,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981025385] [2025-03-17 12:17:29,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981025385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:29,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309251098] [2025-03-17 12:17:29,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:29,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:29,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:29,128 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:29,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 12:17:29,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 12:17:29,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 12:17:29,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:29,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:29,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-17 12:17:29,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:29,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:17:29,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:17:29,499 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:17:29,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:17:29,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:17:29,574 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-17 12:17:29,577 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-17 12:17:29,663 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:17:29,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-03-17 12:17:29,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:17:29,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-03-17 12:17:29,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-17 12:17:29,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:17:29,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:17:29,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:17:29,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2025-03-17 12:17:30,009 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-17 12:17:30,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2025-03-17 12:17:30,022 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-17 12:17:30,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-17 12:17:30,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:17:30,259 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2025-03-17 12:17:30,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2025-03-17 12:17:30,270 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2025-03-17 12:17:30,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2025-03-17 12:17:30,384 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-17 12:17:30,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 79 [2025-03-17 12:17:30,396 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-03-17 12:17:30,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 106 [2025-03-17 12:17:30,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:17:30,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:17:30,500 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-17 12:17:30,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 82 [2025-03-17 12:17:30,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 51 [2025-03-17 12:17:30,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:17:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:17:31,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:17:31,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2050) .cse0) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2051) .cse0) .cse1)))) (forall ((v_ArrVal_2050 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2050) .cse0) .cse1) 4))))) is different from false [2025-03-17 12:17:32,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309251098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:32,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:17:32,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 47 [2025-03-17 12:17:32,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963275922] [2025-03-17 12:17:32,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:17:32,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 12:17:32,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:32,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 12:17:32,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2895, Unknown=26, NotChecked=108, Total=3192 [2025-03-17 12:17:32,044 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 48 states, 45 states have (on average 2.022222222222222) internal successors, (91), 40 states have internal predecessors, (91), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:17:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:34,034 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2025-03-17 12:17:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 12:17:34,034 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.022222222222222) internal successors, (91), 40 states have internal predecessors, (91), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2025-03-17 12:17:34,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:34,035 INFO L225 Difference]: With dead ends: 154 [2025-03-17 12:17:34,035 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 12:17:34,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=424, Invalid=7036, Unknown=26, NotChecked=170, Total=7656 [2025-03-17 12:17:34,037 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 147 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 1911 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:34,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1632 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1911 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 12:17:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 12:17:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 119. [2025-03-17 12:17:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 110 states have internal predecessors, (119), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:17:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2025-03-17 12:17:34,040 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 53 [2025-03-17 12:17:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:34,040 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2025-03-17 12:17:34,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.022222222222222) internal successors, (91), 40 states have internal predecessors, (91), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:17:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2025-03-17 12:17:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 12:17:34,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:34,041 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:34,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 12:17:34,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 12:17:34,242 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:34,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1595757955, now seen corresponding path program 1 times [2025-03-17 12:17:34,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:34,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678835068] [2025-03-17 12:17:34,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:34,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:34,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:17:34,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:17:34,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:34,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:17:34,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:34,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678835068] [2025-03-17 12:17:34,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678835068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:34,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998208589] [2025-03-17 12:17:34,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:34,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:34,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:34,674 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:34,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 12:17:34,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 12:17:34,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 12:17:34,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:34,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:34,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-17 12:17:34,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:34,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:17:34,926 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:17:34,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:17:34,968 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-17 12:17:35,032 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:17:35,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-17 12:17:35,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:17:35,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 12:17:35,222 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:17:35,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 12:17:35,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2025-03-17 12:17:35,356 INFO L349 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2025-03-17 12:17:35,356 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 28 treesize of output 39 [2025-03-17 12:17:35,424 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2025-03-17 12:17:35,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 53 [2025-03-17 12:17:35,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-17 12:17:35,468 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:17:35,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:17:35,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-03-17 12:17:35,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 12:17:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:17:35,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:17:35,546 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2206 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2206) .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2025-03-17 12:17:37,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998208589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:37,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:17:37,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28] total 43 [2025-03-17 12:17:37,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720014218] [2025-03-17 12:17:37,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:17:37,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-17 12:17:37,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:17:37,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 12:17:37,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1864, Unknown=1, NotChecked=86, Total=2070 [2025-03-17 12:17:37,707 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 43 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 36 states have internal predecessors, (87), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:17:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:17:38,827 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2025-03-17 12:17:38,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 12:17:38,827 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 36 states have internal predecessors, (87), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2025-03-17 12:17:38,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:17:38,828 INFO L225 Difference]: With dead ends: 154 [2025-03-17 12:17:38,828 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 12:17:38,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=345, Invalid=5358, Unknown=1, NotChecked=148, Total=5852 [2025-03-17 12:17:38,829 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 152 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:17:38,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1524 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 12:17:38,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 12:17:38,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 119. [2025-03-17 12:17:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 110 states have internal predecessors, (118), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 12:17:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2025-03-17 12:17:38,834 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 56 [2025-03-17 12:17:38,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:17:38,835 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2025-03-17 12:17:38,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 36 states have internal predecessors, (87), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-17 12:17:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2025-03-17 12:17:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 12:17:38,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:17:38,835 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:17:38,842 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-17 12:17:39,035 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,SelfDestructingSolverStorable25 [2025-03-17 12:17:39,036 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 49 more)] === [2025-03-17 12:17:39,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:17:39,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2085498971, now seen corresponding path program 1 times [2025-03-17 12:17:39,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:17:39,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550476203] [2025-03-17 12:17:39,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:39,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:17:39,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 12:17:39,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 12:17:39,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:39,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:17:39,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:17:39,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550476203] [2025-03-17 12:17:39,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550476203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:17:39,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997983525] [2025-03-17 12:17:39,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:17:39,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:17:39,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:17:39,843 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:17:39,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 12:17:39,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 12:17:40,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 12:17:40,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:17:40,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:17:40,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-17 12:17:40,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:17:40,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 12:17:40,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:17:40,495 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 12:17:40,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-17 12:17:40,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:17:40,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 12:17:40,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 12:17:40,993 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-17 12:17:40,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 76 [2025-03-17 12:17:40,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2025-03-17 12:17:41,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2025-03-17 12:17:41,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:17:41,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-17 12:17:41,279 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:17:41,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-03-17 12:17:41,282 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:17:41,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:17:41,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-03-17 12:17:41,366 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-17 12:17:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:17:41,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:17:41,599 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2355 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2356) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2355) .cse0) .cse1)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2357) .cse0) .cse1) 4)))) (not (= v_ArrVal_2356 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))) is different from false [2025-03-17 12:17:41,607 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:17:41,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 62 [2025-03-17 12:17:41,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:17:41,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 123 [2025-03-17 12:17:41,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:17:41,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 92 [2025-03-17 12:17:41,637 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 44 treesize of output 38 [2025-03-17 12:17:41,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:17:41,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 149 [2025-03-17 12:17:41,650 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 29 treesize of output 23 [2025-03-17 12:17:42,886 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (= .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse11 (not .cse13)) (.cse12 (forall ((v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_arrayElimCell_125 Int) (v_arrayElimCell_128 Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2353) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2356) v_arrayElimCell_125) (+ v_arrayElimCell_128 4))) (not (= v_ArrVal_2356 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) (.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse5 (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0))) (let ((.cse2 (let ((.cse24 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (< .cse24 1) .cse5) (or (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (+ .cse24 1)) .cse5)))) (.cse6 (or (forall ((v_ArrVal_2356 (Array Int Int)) (v_arrayElimCell_123 Int) (v_ArrVal_2353 (Array Int Int)) (v_arrayElimCell_126 Int)) (let ((.cse23 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2353))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse23 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2356) v_arrayElimCell_123) (+ v_arrayElimCell_126 4))) (not (= v_ArrVal_2356 (store (select .cse23 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) .cse13)) (.cse7 (forall ((v_ArrVal_2356 (Array Int Int)) (v_arrayElimCell_126 Int) (v_ArrVal_2353 (Array Int Int)) (v_arrayElimCell_125 Int) (v_arrayElimCell_128 Int)) (let ((.cse22 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2353))) (or (= (select v_ArrVal_2356 (+ v_arrayElimCell_126 4)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2356) v_arrayElimCell_125) (+ v_arrayElimCell_128 4))) (not (= v_ArrVal_2356 (store (select .cse22 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))) (.cse8 (or (forall ((v_DerPreprocessor_6 Int) (v_ArrVal_2353 (Array Int Int)) (v_arrayElimCell_126 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2353) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_6) (+ v_arrayElimCell_126 4)))) .cse13)) (.cse9 (forall ((v_ArrVal_2356 (Array Int Int)) (v_arrayElimCell_123 Int) (v_arrayElimCell_126 Int) (v_ArrVal_2353 (Array Int Int)) (v_arrayElimCell_125 Int) (v_arrayElimCell_128 Int)) (let ((.cse21 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2353))) (let ((.cse20 (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2356))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_123) (+ v_arrayElimCell_126 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse20 v_arrayElimCell_125) (+ v_arrayElimCell_128 4))) (not (= v_ArrVal_2356 (store (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))) (.cse10 (= .cse19 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse0 (or .cse13 (forall ((v_ArrVal_2356 (Array Int Int)) (v_arrayElimCell_123 Int) (v_ArrVal_2353 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2353))) (or (= (select (select (store .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2356) v_arrayElimCell_123) .cse4) |c_ULTIMATE.start_main_~data~0#1|) (not (= v_ArrVal_2356 (store (select .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))) (.cse15 (or .cse11 .cse12)) (.cse1 (forall ((v_ArrVal_2356 (Array Int Int)) (v_arrayElimCell_123 Int) (v_ArrVal_2353 (Array Int Int)) (v_arrayElimCell_125 Int) (v_arrayElimCell_128 Int)) (let ((.cse17 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2353))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2356))) (or (= (select (select .cse16 v_arrayElimCell_123) .cse4) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_125) (+ v_arrayElimCell_128 4))) (not (= v_ArrVal_2356 (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))))) (and (or (and .cse0 .cse1) .cse2) (or (forall ((v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_arrayElimCell_125 Int) (v_arrayElimCell_128 Int)) (let ((.cse3 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2353))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2356) v_arrayElimCell_125) (+ v_arrayElimCell_128 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_2356 .cse4)) (not (= v_ArrVal_2356 (store (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) .cse5) (or (and .cse6 .cse7 .cse8 .cse9 (or .cse10 .cse11 .cse12)) .cse2) (or .cse13 .cse5 (forall ((v_ArrVal_2353 (Array Int Int))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2353) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse4) |c_ULTIMATE.start_main_~data~0#1|))) (or (forall ((v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2353 (Array Int Int)) (v_arrayElimCell_125 Int) (v_arrayElimCell_128 Int)) (let ((.cse14 (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2353))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2356) v_arrayElimCell_125) (+ v_arrayElimCell_128 4))) (not (= v_ArrVal_2356 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_2356 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) .cse5 .cse11) (or (and .cse6 .cse7 .cse15 .cse8 .cse9) .cse5 .cse10) (or .cse5 .cse10 (and .cse0 .cse15 .cse1))))))) is different from false [2025-03-17 12:17:46,568 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2025-03-17 12:17:46,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 2864 treesize of output 3051 [2025-03-17 12:17:46,677 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 1856 treesize of output 1852 [2025-03-17 12:17:46,728 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 1852 treesize of output 1848 [2025-03-17 12:17:46,922 INFO L224 Elim1Store]: Index analysis took 116 ms [2025-03-17 12:17:48,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:17:48,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 2362 treesize of output 3812 [2025-03-17 12:17:49,696 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2025-03-17 12:17:49,697 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2153 treesize of output 2187 [2025-03-17 12:17:50,155 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-03-17 12:17:50,156 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2140 treesize of output 2155 [2025-03-17 12:17:50,691 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-03-17 12:17:50,692 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2131 treesize of output 2146 [2025-03-17 12:17:51,157 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 2136 treesize of output 2132 [2025-03-17 12:17:51,607 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 2132 treesize of output 2130 [2025-03-17 12:17:52,101 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-03-17 12:17:52,101 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2130 treesize of output 2145 [2025-03-17 12:17:52,606 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-03-17 12:17:52,607 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2121 treesize of output 2136 [2025-03-17 12:17:53,133 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2025-03-17 12:17:53,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2112 treesize of output 2131 [2025-03-17 12:17:54,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:17:54,031 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2103 treesize of output 2111 [2025-03-17 12:17:54,998 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2025-03-17 12:17:54,999 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2098 treesize of output 2132 [2025-03-17 12:17:55,572 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2025-03-17 12:17:55,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2085 treesize of output 2104 [2025-03-17 12:17:56,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:17:56,495 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2076 treesize of output 2084 [2025-03-17 12:17:57,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2071 treesize of output 2067 [2025-03-17 12:17:58,094 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-03-17 12:17:58,094 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2067 treesize of output 2082 [2025-03-17 12:17:58,657 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 2072 treesize of output 2068 [2025-03-17 12:17:59,302 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2025-03-17 12:17:59,303 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 2068 treesize of output 2083