./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:30:55,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:30:55,352 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 17:30:55,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:30:55,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:30:55,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:30:55,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:30:55,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:30:55,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:30:55,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:30:55,382 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:30:55,383 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:30:55,383 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:30:55,384 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:30:55,384 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:30:55,385 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:30:55,385 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:30:55,386 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:30:55,386 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:30:55,387 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:30:55,387 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:30:55,390 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:30:55,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 17:30:55,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 17:30:55,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:30:55,393 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:30:55,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:30:55,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:30:55,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:30:55,394 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 17:30:55,394 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 17:30:55,395 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 17:30:55,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:30:55,395 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:30:55,395 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 17:30:55,396 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:30:55,396 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:30:55,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:30:55,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:30:55,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:30:55,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:30:55,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:30:55,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:30:55,397 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:30:55,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:30:55,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:30:55,398 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:30:55,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:30:55,398 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> db322df1d89bf1549765f136e3e3b8000484c0c3108c31998992cf725d6dcc20 [2023-12-02 17:30:55,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:30:55,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:30:55,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:30:55,639 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:30:55,640 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:30:55,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2023-12-02 17:30:58,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:30:58,692 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:30:58,693 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/sv-benchmarks/c/memsafety-ext2/split_list_test05-2.i [2023-12-02 17:30:58,708 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/data/33df2a389/66c6a1ef47a7484f8da26ad0445a0d5a/FLAG8c5140edb [2023-12-02 17:30:58,723 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/data/33df2a389/66c6a1ef47a7484f8da26ad0445a0d5a [2023-12-02 17:30:58,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:30:58,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:30:58,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:30:58,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:30:58,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:30:58,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:30:58" (1/1) ... [2023-12-02 17:30:58,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3b83c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:58, skipping insertion in model container [2023-12-02 17:30:58,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:30:58" (1/1) ... [2023-12-02 17:30:58,783 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:30:59,069 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:30:59,079 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:30:59,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:30:59,156 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:30:59,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59 WrapperNode [2023-12-02 17:30:59,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:30:59,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:30:59,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:30:59,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:30:59,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59" (1/1) ... [2023-12-02 17:30:59,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59" (1/1) ... [2023-12-02 17:30:59,214 INFO L138 Inliner]: procedures = 125, calls = 95, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 313 [2023-12-02 17:30:59,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:30:59,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:30:59,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:30:59,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:30:59,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59" (1/1) ... [2023-12-02 17:30:59,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59" (1/1) ... [2023-12-02 17:30:59,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59" (1/1) ... [2023-12-02 17:30:59,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59" (1/1) ... [2023-12-02 17:30:59,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59" (1/1) ... [2023-12-02 17:30:59,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59" (1/1) ... [2023-12-02 17:30:59,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59" (1/1) ... [2023-12-02 17:30:59,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59" (1/1) ... [2023-12-02 17:30:59,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:30:59,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:30:59,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:30:59,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:30:59,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59" (1/1) ... [2023-12-02 17:30:59,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:30:59,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:59,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:30:59,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:30:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 17:30:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 17:30:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 17:30:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:30:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 17:30:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 17:30:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:30:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 17:30:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:30:59,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:30:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure append [2023-12-02 17:30:59,322 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2023-12-02 17:30:59,432 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:30:59,434 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:31:00,116 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:31:00,186 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:31:00,186 INFO L309 CfgBuilder]: Removed 11 assume(true) statements. [2023-12-02 17:31:00,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:31:00 BoogieIcfgContainer [2023-12-02 17:31:00,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:31:00,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:31:00,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:31:00,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:31:00,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:30:58" (1/3) ... [2023-12-02 17:31:00,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e3814b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:31:00, skipping insertion in model container [2023-12-02 17:31:00,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:59" (2/3) ... [2023-12-02 17:31:00,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e3814b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:31:00, skipping insertion in model container [2023-12-02 17:31:00,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:31:00" (3/3) ... [2023-12-02 17:31:00,198 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05-2.i [2023-12-02 17:31:00,218 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:31:00,219 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2023-12-02 17:31:00,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:31:00,279 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@22cdf5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:31:00,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2023-12-02 17:31:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 293 states, 129 states have (on average 2.356589147286822) internal successors, (304), 278 states have internal predecessors, (304), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 17:31:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 17:31:00,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:00,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 17:31:00,291 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-12-02 17:31:00,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:00,297 INFO L85 PathProgramCache]: Analyzing trace with hash 18387, now seen corresponding path program 1 times [2023-12-02 17:31:00,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:00,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804164624] [2023-12-02 17:31:00,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:00,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:00,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804164624] [2023-12-02 17:31:00,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804164624] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:31:00,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:31:00,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 17:31:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956236633] [2023-12-02 17:31:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:31:00,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:31:00,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:00,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:31:00,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:31:00,522 INFO L87 Difference]: Start difference. First operand has 293 states, 129 states have (on average 2.356589147286822) internal successors, (304), 278 states have internal predecessors, (304), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:00,968 INFO L93 Difference]: Finished difference Result 499 states and 552 transitions. [2023-12-02 17:31:00,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:31:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 17:31:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:00,984 INFO L225 Difference]: With dead ends: 499 [2023-12-02 17:31:00,985 INFO L226 Difference]: Without dead ends: 498 [2023-12-02 17:31:00,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:31:00,990 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 224 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:00,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 362 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:31:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-12-02 17:31:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 364. [2023-12-02 17:31:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 203 states have (on average 2.3201970443349755) internal successors, (471), 349 states have internal predecessors, (471), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 17:31:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 501 transitions. [2023-12-02 17:31:01,060 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 501 transitions. Word has length 2 [2023-12-02 17:31:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:01,073 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 501 transitions. [2023-12-02 17:31:01,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 501 transitions. [2023-12-02 17:31:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 17:31:01,073 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:01,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 17:31:01,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 17:31:01,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-12-02 17:31:01,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash 18388, now seen corresponding path program 1 times [2023-12-02 17:31:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:01,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021905778] [2023-12-02 17:31:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:01,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:01,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021905778] [2023-12-02 17:31:01,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021905778] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:31:01,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:31:01,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 17:31:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492973819] [2023-12-02 17:31:01,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:31:01,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:31:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:01,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:31:01,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:31:01,192 INFO L87 Difference]: Start difference. First operand 364 states and 501 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:01,417 INFO L93 Difference]: Finished difference Result 365 states and 504 transitions. [2023-12-02 17:31:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:31:01,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 17:31:01,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:01,421 INFO L225 Difference]: With dead ends: 365 [2023-12-02 17:31:01,421 INFO L226 Difference]: Without dead ends: 365 [2023-12-02 17:31:01,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:31:01,423 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 5 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:01,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 459 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:31:01,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-12-02 17:31:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2023-12-02 17:31:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 203 states have (on average 2.310344827586207) internal successors, (469), 347 states have internal predecessors, (469), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 17:31:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 499 transitions. [2023-12-02 17:31:01,446 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 499 transitions. Word has length 2 [2023-12-02 17:31:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:01,447 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 499 transitions. [2023-12-02 17:31:01,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 499 transitions. [2023-12-02 17:31:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 17:31:01,448 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:01,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:01,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 17:31:01,448 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-12-02 17:31:01,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:01,449 INFO L85 PathProgramCache]: Analyzing trace with hash -686008025, now seen corresponding path program 1 times [2023-12-02 17:31:01,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:01,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124539173] [2023-12-02 17:31:01,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:01,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:01,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:01,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124539173] [2023-12-02 17:31:01,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124539173] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:31:01,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:31:01,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:31:01,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483590616] [2023-12-02 17:31:01,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:31:01,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:31:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:01,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:31:01,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:31:01,547 INFO L87 Difference]: Start difference. First operand 362 states and 499 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-12-02 17:31:01,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:01,786 INFO L93 Difference]: Finished difference Result 357 states and 494 transitions. [2023-12-02 17:31:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:31:01,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2023-12-02 17:31:01,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:01,789 INFO L225 Difference]: With dead ends: 357 [2023-12-02 17:31:01,789 INFO L226 Difference]: Without dead ends: 357 [2023-12-02 17:31:01,789 INFO L412 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 [2023-12-02 17:31:01,791 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 39 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:01,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 398 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:31:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-12-02 17:31:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2023-12-02 17:31:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 203 states have (on average 2.2857142857142856) internal successors, (464), 342 states have internal predecessors, (464), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 17:31:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 494 transitions. [2023-12-02 17:31:01,807 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 494 transitions. Word has length 8 [2023-12-02 17:31:01,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:01,807 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 494 transitions. [2023-12-02 17:31:01,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-12-02 17:31:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 494 transitions. [2023-12-02 17:31:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 17:31:01,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:01,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:01,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 17:31:01,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-12-02 17:31:01,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:01,809 INFO L85 PathProgramCache]: Analyzing trace with hash -686008024, now seen corresponding path program 1 times [2023-12-02 17:31:01,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:01,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488756089] [2023-12-02 17:31:01,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:01,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:01,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:01,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488756089] [2023-12-02 17:31:01,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488756089] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:31:01,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:31:01,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:31:01,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500602029] [2023-12-02 17:31:01,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:31:01,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:31:01,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:01,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:31:01,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:31:01,909 INFO L87 Difference]: Start difference. First operand 357 states and 494 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-12-02 17:31:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:02,144 INFO L93 Difference]: Finished difference Result 352 states and 489 transitions. [2023-12-02 17:31:02,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:31:02,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2023-12-02 17:31:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:02,147 INFO L225 Difference]: With dead ends: 352 [2023-12-02 17:31:02,147 INFO L226 Difference]: Without dead ends: 352 [2023-12-02 17:31:02,147 INFO L412 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 [2023-12-02 17:31:02,148 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 34 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:02,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 409 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:31:02,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-12-02 17:31:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2023-12-02 17:31:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 203 states have (on average 2.2610837438423643) internal successors, (459), 337 states have internal predecessors, (459), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 17:31:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 489 transitions. [2023-12-02 17:31:02,162 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 489 transitions. Word has length 8 [2023-12-02 17:31:02,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:02,162 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 489 transitions. [2023-12-02 17:31:02,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-12-02 17:31:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 489 transitions. [2023-12-02 17:31:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 17:31:02,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:02,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:02,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 17:31:02,164 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-12-02 17:31:02,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash 208588129, now seen corresponding path program 1 times [2023-12-02 17:31:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:02,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371231664] [2023-12-02 17:31:02,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:02,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:02,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:02,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371231664] [2023-12-02 17:31:02,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371231664] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:31:02,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:31:02,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:31:02,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844531205] [2023-12-02 17:31:02,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:31:02,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:31:02,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:02,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:31:02,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:31:02,318 INFO L87 Difference]: Start difference. First operand 352 states and 489 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2023-12-02 17:31:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:02,879 INFO L93 Difference]: Finished difference Result 475 states and 526 transitions. [2023-12-02 17:31:02,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:31:02,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2023-12-02 17:31:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:02,883 INFO L225 Difference]: With dead ends: 475 [2023-12-02 17:31:02,883 INFO L226 Difference]: Without dead ends: 475 [2023-12-02 17:31:02,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:31:02,884 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 288 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:02,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 621 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 17:31:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2023-12-02 17:31:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 344. [2023-12-02 17:31:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 203 states have (on average 2.2216748768472905) internal successors, (451), 329 states have internal predecessors, (451), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 17:31:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2023-12-02 17:31:02,897 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 9 [2023-12-02 17:31:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:02,897 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2023-12-02 17:31:02,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2023-12-02 17:31:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2023-12-02 17:31:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 17:31:02,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:02,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:02,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 17:31:02,898 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-12-02 17:31:02,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:02,898 INFO L85 PathProgramCache]: Analyzing trace with hash 208588130, now seen corresponding path program 1 times [2023-12-02 17:31:02,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:02,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766271502] [2023-12-02 17:31:02,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:02,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:03,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:03,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766271502] [2023-12-02 17:31:03,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766271502] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:31:03,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:31:03,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:31:03,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336260466] [2023-12-02 17:31:03,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:31:03,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:31:03,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:03,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:31:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:31:03,083 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2023-12-02 17:31:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:03,779 INFO L93 Difference]: Finished difference Result 465 states and 516 transitions. [2023-12-02 17:31:03,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:31:03,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2023-12-02 17:31:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:03,783 INFO L225 Difference]: With dead ends: 465 [2023-12-02 17:31:03,783 INFO L226 Difference]: Without dead ends: 465 [2023-12-02 17:31:03,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:31:03,784 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 732 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:03,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 299 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 17:31:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2023-12-02 17:31:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 335. [2023-12-02 17:31:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 203 states have (on average 2.1724137931034484) internal successors, (441), 320 states have internal predecessors, (441), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 17:31:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 471 transitions. [2023-12-02 17:31:03,796 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 471 transitions. Word has length 9 [2023-12-02 17:31:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:03,796 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 471 transitions. [2023-12-02 17:31:03,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2023-12-02 17:31:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 471 transitions. [2023-12-02 17:31:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:31:03,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:03,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:03,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 17:31:03,797 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-12-02 17:31:03,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1429426753, now seen corresponding path program 1 times [2023-12-02 17:31:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:03,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487707667] [2023-12-02 17:31:03,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:04,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:04,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487707667] [2023-12-02 17:31:04,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487707667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:31:04,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:31:04,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 17:31:04,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088383631] [2023-12-02 17:31:04,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:31:04,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 17:31:04,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:04,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 17:31:04,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:31:04,123 INFO L87 Difference]: Start difference. First operand 335 states and 471 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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) [2023-12-02 17:31:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:04,519 INFO L93 Difference]: Finished difference Result 352 states and 491 transitions. [2023-12-02 17:31:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:31:04,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 16 [2023-12-02 17:31:04,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:04,522 INFO L225 Difference]: With dead ends: 352 [2023-12-02 17:31:04,522 INFO L226 Difference]: Without dead ends: 352 [2023-12-02 17:31:04,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:31:04,524 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 20 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:04,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1012 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:31:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-12-02 17:31:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 342. [2023-12-02 17:31:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 209 states have (on average 2.1435406698564594) internal successors, (448), 326 states have internal predecessors, (448), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 17:31:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 480 transitions. [2023-12-02 17:31:04,534 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 480 transitions. Word has length 16 [2023-12-02 17:31:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:04,535 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 480 transitions. [2023-12-02 17:31:04,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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) [2023-12-02 17:31:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 480 transitions. [2023-12-02 17:31:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 17:31:04,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:04,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:04,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 17:31:04,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-12-02 17:31:04,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1613506389, now seen corresponding path program 1 times [2023-12-02 17:31:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:04,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275832793] [2023-12-02 17:31:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:04,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:04,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:04,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275832793] [2023-12-02 17:31:04,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275832793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:31:04,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:31:04,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 17:31:04,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7193458] [2023-12-02 17:31:04,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:31:04,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 17:31:04,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:31:04,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 17:31:04,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:31:04,901 INFO L87 Difference]: Start difference. First operand 342 states and 480 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 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) [2023-12-02 17:31:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:05,659 INFO L93 Difference]: Finished difference Result 476 states and 529 transitions. [2023-12-02 17:31:05,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 17:31:05,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 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 17 [2023-12-02 17:31:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:05,663 INFO L225 Difference]: With dead ends: 476 [2023-12-02 17:31:05,663 INFO L226 Difference]: Without dead ends: 476 [2023-12-02 17:31:05,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-02 17:31:05,664 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 684 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:05,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1037 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 17:31:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2023-12-02 17:31:05,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 344. [2023-12-02 17:31:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 211 states have (on average 2.132701421800948) internal successors, (450), 328 states have internal predecessors, (450), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 17:31:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 482 transitions. [2023-12-02 17:31:05,676 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 482 transitions. Word has length 17 [2023-12-02 17:31:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:05,676 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 482 transitions. [2023-12-02 17:31:05,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 7 states have internal predecessors, (16), 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) [2023-12-02 17:31:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 482 transitions. [2023-12-02 17:31:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 17:31:05,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:05,678 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:05,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 17:31:05,678 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-12-02 17:31:05,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:05,679 INFO L85 PathProgramCache]: Analyzing trace with hash -697549908, now seen corresponding path program 1 times [2023-12-02 17:31:05,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:05,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022065509] [2023-12-02 17:31:05,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:05,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:06,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022065509] [2023-12-02 17:31:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022065509] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034496653] [2023-12-02 17:31:06,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:06,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:06,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:06,602 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:06,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 17:31:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:06,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 17:31:06,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:06,819 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 [2023-12-02 17:31:07,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 17:31:07,143 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 17:31:07,143 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 18 treesize of output 17 [2023-12-02 17:31:07,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 17:31:07,287 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 17:31:07,287 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 33 treesize of output 32 [2023-12-02 17:31:07,318 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 17:31:07,472 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:31:07,480 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 17:31:07,481 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 29 treesize of output 28 [2023-12-02 17:31:07,671 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2023-12-02 17:31:07,672 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 28 treesize of output 36 [2023-12-02 17:31:07,725 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 34 treesize of output 25 [2023-12-02 17:31:07,844 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 34 treesize of output 25 [2023-12-02 17:31:07,866 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 34 treesize of output 25 [2023-12-02 17:31:07,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 17:31:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:07,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:12,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:12,474 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 33 treesize of output 34 [2023-12-02 17:31:12,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:12,492 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 170 treesize of output 118 [2023-12-02 17:31:12,502 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 86 treesize of output 78 [2023-12-02 17:31:12,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-12-02 17:31:12,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034496653] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:12,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1464741890] [2023-12-02 17:31:12,989 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-12-02 17:31:12,989 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:31:12,993 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:31:12,999 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:31:12,999 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:31:13,776 INFO L197 IcfgInterpreter]: Interpreting procedure append with input of size 266 for LOIs [2023-12-02 17:31:16,932 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:31:33,364 WARN L293 SmtUtils]: Spent 9.59s on a formula simplification. DAG size of input: 266 DAG size of output: 263 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:32:04,232 WARN L293 SmtUtils]: Spent 23.48s on a formula simplification. DAG size of input: 289 DAG size of output: 286 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:32:55,760 WARN L293 SmtUtils]: Spent 37.61s on a formula simplification. DAG size of input: 312 DAG size of output: 305 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:34:14,590 WARN L293 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 336 DAG size of output: 327 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:35:40,957 WARN L293 SmtUtils]: Spent 1.10m on a formula simplification. DAG size of input: 329 DAG size of output: 320 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:37:42,576 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6654#(and (<= 1 |#StackHeapBarrier|) (<= 0 (+ append_~input 128)) (exists ((|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_143| append_~node~0.base (store (store (select |v_#memory_$Pointer$.offset_143| append_~node~0.base) 1 (select (select |v_#memory_$Pointer$.offset_143| append_~head.base) 4)) 5 0)))) (= append_~node~0.offset 0) (<= 0 (+ 128 |append_#in~input|)) (exists ((|v_#memory_int_123| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_124| append_~node~0.base (store (select |v_#memory_int_124| append_~node~0.base) 5 (select (select |#memory_int| append_~node~0.base) 5)))) (= |v_#memory_int_124| (store |v_#memory_int_123| append_~node~0.base (store (select |v_#memory_int_123| append_~node~0.base) 1 (select (select |v_#memory_int_124| append_~node~0.base) 1)))))) (= |append_#t~mem60.base| (select (select |#memory_$Pointer$.base| append_~head.base) 4)) (= |append_#in~head.offset| 0) (= (select |#valid| append_~head.base) 1) (= (select |#valid| append_~node~0.base) 1) (not (= (select |#valid| |append_#t~mem60.base|) 1)) (<= append_~input 127) (= append_~head.offset 0) (<= |append_#in~input| 127) (<= 9 (select |#length| append_~node~0.base)) (exists ((|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_151| append_~node~0.base (store (store (select |v_#memory_$Pointer$.base_151| append_~node~0.base) 1 (select (select |v_#memory_$Pointer$.base_151| append_~head.base) 4)) 5 0)) |#memory_$Pointer$.base|)) (<= 8 (select |#length| append_~head.base)) (= |append_#t~mem60.offset| (select (select |#memory_$Pointer$.offset| append_~head.base) 4)))' at error location [2023-12-02 17:37:42,576 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:37:42,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:37:42,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-12-02 17:37:42,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891196132] [2023-12-02 17:37:42,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:37:42,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 17:37:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:37:42,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 17:37:42,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2797, Unknown=53, NotChecked=0, Total=3080 [2023-12-02 17:37:42,579 INFO L87 Difference]: Start difference. First operand 344 states and 482 transitions. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 24 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:37:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:46,818 INFO L93 Difference]: Finished difference Result 479 states and 531 transitions. [2023-12-02 17:37:46,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 17:37:46,819 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 24 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2023-12-02 17:37:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:46,823 INFO L225 Difference]: With dead ends: 479 [2023-12-02 17:37:46,823 INFO L226 Difference]: Without dead ends: 479 [2023-12-02 17:37:46,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1338 ImplicationChecksByTransitivity, 391.8s TimeCoverageRelationStatistics Valid=377, Invalid=3728, Unknown=55, NotChecked=0, Total=4160 [2023-12-02 17:37:46,825 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 1058 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:46,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 1414 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-02 17:37:46,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2023-12-02 17:37:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 349. [2023-12-02 17:37:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 216 states have (on average 2.1018518518518516) internal successors, (454), 333 states have internal predecessors, (454), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 17:37:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 486 transitions. [2023-12-02 17:37:46,840 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 486 transitions. Word has length 31 [2023-12-02 17:37:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:46,840 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 486 transitions. [2023-12-02 17:37:46,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 24 states have internal predecessors, (56), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:37:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 486 transitions. [2023-12-02 17:37:46,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 17:37:46,842 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:46,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:46,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:37:47,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:37:47,043 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-12-02 17:37:47,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:47,043 INFO L85 PathProgramCache]: Analyzing trace with hash -697549907, now seen corresponding path program 1 times [2023-12-02 17:37:47,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:37:47,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925206712] [2023-12-02 17:37:47,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:47,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:37:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:51,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:37:51,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925206712] [2023-12-02 17:37:51,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925206712] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:37:51,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774992172] [2023-12-02 17:37:51,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:51,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:37:51,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:37:51,034 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:37:51,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 17:37:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:51,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 17:37:51,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:51,165 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 [2023-12-02 17:37:51,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 17:37:51,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 17:37:51,903 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 17:37:51,903 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 18 treesize of output 17 [2023-12-02 17:37:51,932 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 17:37:51,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2023-12-02 17:37:51,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 17:37:51,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 17:37:52,176 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 17:37:52,176 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 42 treesize of output 41 [2023-12-02 17:37:52,207 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 17:37:52,207 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 40 treesize of output 39 [2023-12-02 17:37:52,253 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 17:37:52,317 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 17:37:52,636 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:37:52,654 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 17:37:52,654 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 29 treesize of output 28 [2023-12-02 17:37:53,055 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-02 17:37:53,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-02 17:37:53,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-02 17:37:53,183 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 40 treesize of output 31 [2023-12-02 17:37:53,188 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 31 treesize of output 24 [2023-12-02 17:37:53,380 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 40 treesize of output 31 [2023-12-02 17:37:53,385 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 31 treesize of output 24 [2023-12-02 17:37:53,414 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 40 treesize of output 31 [2023-12-02 17:37:53,420 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 31 treesize of output 24 [2023-12-02 17:37:53,536 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 31 treesize of output 19 [2023-12-02 17:37:53,540 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 26 treesize of output 14 [2023-12-02 17:37:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:53,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:37:53,821 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_append_~head.offset 4))) (and (forall ((v_ArrVal_443 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_443) c_append_~head.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| c_append_~node~0.base v_ArrVal_442) c_append_~head.base) .cse0)))) (forall ((v_ArrVal_443 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$.offset| c_append_~node~0.base v_ArrVal_443) c_append_~head.base) .cse0)))))) is different from false [2023-12-02 17:37:54,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:54,888 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 114 treesize of output 115 [2023-12-02 17:37:54,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:54,908 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 134 treesize of output 125 [2023-12-02 17:37:54,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:54,931 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 492 treesize of output 356 [2023-12-02 17:37:54,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:54,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1070 treesize of output 1022 [2023-12-02 17:37:55,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:55,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 279 treesize of output 329 [2023-12-02 17:37:55,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:55,154 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 251 treesize of output 248 [2023-12-02 17:37:55,181 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 280 treesize of output 260 [2023-12-02 17:37:55,218 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 231 treesize of output 215 [2023-12-02 17:37:55,244 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 252 treesize of output 224 [2023-12-02 17:37:55,268 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 199 treesize of output 191 [2023-12-02 17:37:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774992172] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:37:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1787756471] [2023-12-02 17:37:58,645 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-12-02 17:37:58,645 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:37:58,646 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:37:58,646 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:37:58,646 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:37:59,216 INFO L197 IcfgInterpreter]: Interpreting procedure append with input of size 270 for LOIs [2023-12-02 17:38:02,273 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:38:30,513 WARN L293 SmtUtils]: Spent 13.35s on a formula simplification. DAG size of input: 270 DAG size of output: 263 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:39:10,417 WARN L293 SmtUtils]: Spent 23.98s on a formula simplification. DAG size of input: 293 DAG size of output: 286 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:40:15,253 WARN L293 SmtUtils]: Spent 43.56s on a formula simplification. DAG size of input: 316 DAG size of output: 305 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:41:45,185 WARN L293 SmtUtils]: Spent 1.06m on a formula simplification. DAG size of input: 340 DAG size of output: 327 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:43:26,834 WARN L293 SmtUtils]: Spent 1.18m on a formula simplification. DAG size of input: 333 DAG size of output: 320 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:44:04,086 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~userInput~1#1| 127) (<= 1 |c_#StackHeapBarrier|) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~userInput~1#1| 60))) (.cse1 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse2 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse3 (<= (+ |c_ULTIMATE.start_main_~list~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse4 (exists ((|v_#length_230| (Array Int Int))) (and (= 22 (select |v_#length_230| 2)) (= 2 (select |v_#length_230| 1))))) (.cse5 (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0))) (.cse6 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~list~0#1.base|) 0)) (.cse7 (not (= |c_ULTIMATE.start_main_~userInput~1#1| 62))) (.cse13 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((v_append_~head.offset_BEFORE_RETURN_3 Int) (v_append_~node~0.base_BEFORE_RETURN_3 Int) (|v_#memory_$Pointer$.offset_171| (Array Int (Array Int Int))) (|v_#memory_int_143| (Array Int (Array Int Int))) (|v_#memory_int_144| (Array Int (Array Int Int))) (|v_#memory_int_145| (Array Int (Array Int Int))) (v_append_~head.base_BEFORE_RETURN_3 Int) (|v_#memory_int_146| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_179| (Array Int (Array Int Int)))) (let ((.cse9 (+ v_append_~head.offset_BEFORE_RETURN_3 4)) (.cse10 (select |v_#memory_int_146| v_append_~node~0.base_BEFORE_RETURN_3)) (.cse8 (select |v_#memory_int_144| v_append_~head.base_BEFORE_RETURN_3))) (and (<= (+ v_append_~head.offset_BEFORE_RETURN_3 8) (select |c_#length| v_append_~head.base_BEFORE_RETURN_3)) (<= 0 v_append_~head.offset_BEFORE_RETURN_3) (= (store |v_#memory_int_144| v_append_~head.base_BEFORE_RETURN_3 (store .cse8 .cse9 (select (select |v_#memory_int_145| v_append_~head.base_BEFORE_RETURN_3) .cse9))) |v_#memory_int_145|) (= (select |c_#valid| v_append_~head.base_BEFORE_RETURN_3) 1) (= (select |c_#valid| v_append_~node~0.base_BEFORE_RETURN_3) 1) (= (store |v_#memory_int_146| v_append_~node~0.base_BEFORE_RETURN_3 (store .cse10 5 (select (select |c_#memory_int| v_append_~node~0.base_BEFORE_RETURN_3) 5))) |c_#memory_int|) (<= 9 (select |c_#length| v_append_~node~0.base_BEFORE_RETURN_3)) (= (let ((.cse11 (store |v_#memory_$Pointer$.base_179| v_append_~head.base_BEFORE_RETURN_3 (store (store (select |v_#memory_$Pointer$.base_179| v_append_~head.base_BEFORE_RETURN_3) v_append_~head.offset_BEFORE_RETURN_3 v_append_~node~0.base_BEFORE_RETURN_3) .cse9 v_append_~node~0.base_BEFORE_RETURN_3)))) (store .cse11 v_append_~node~0.base_BEFORE_RETURN_3 (store (store (select .cse11 v_append_~node~0.base_BEFORE_RETURN_3) 1 0) 5 0))) |c_#memory_$Pointer$.base|) (= (let ((.cse12 (store |v_#memory_$Pointer$.offset_171| v_append_~head.base_BEFORE_RETURN_3 (store (store (select |v_#memory_$Pointer$.offset_171| v_append_~head.base_BEFORE_RETURN_3) v_append_~head.offset_BEFORE_RETURN_3 0) .cse9 0)))) (store .cse12 v_append_~node~0.base_BEFORE_RETURN_3 (store (store (select .cse12 v_append_~node~0.base_BEFORE_RETURN_3) 1 0) 5 0))) |c_#memory_$Pointer$.offset|) (= (store |v_#memory_int_145| v_append_~node~0.base_BEFORE_RETURN_3 (store (select |v_#memory_int_145| v_append_~node~0.base_BEFORE_RETURN_3) 1 (select .cse10 1))) |v_#memory_int_146|) (= (store |v_#memory_int_143| v_append_~head.base_BEFORE_RETURN_3 (store (select |v_#memory_int_143| v_append_~head.base_BEFORE_RETURN_3) v_append_~head.offset_BEFORE_RETURN_3 (select .cse8 v_append_~head.offset_BEFORE_RETURN_3))) |v_#memory_int_144|)))) .cse13 (exists ((|v_old(#memory_int)_AFTER_CALL_7| (Array Int (Array Int Int))) (|v_#memory_int_140| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int)))) (let ((.cse15 (select |v_#memory_int_140| 1)) (.cse14 (select |v_#memory_int_141| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_int_141| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse14 4 (select (select |v_old(#memory_int)_AFTER_CALL_7| |c_ULTIMATE.start_main_~list~0#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_7|) (= 48 (select .cse15 0)) (= (select .cse15 1) 0) (= (store |v_#memory_int_140| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_140| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse14 0))) |v_#memory_int_141|))))) (and .cse0 (exists ((v_append_~node~0.base_BEFORE_RETURN_4 Int) (v_append_~head.offset_BEFORE_RETURN_4 Int) (|v_#memory_$Pointer$.offset_171| (Array Int (Array Int Int))) (|v_#memory_int_143| (Array Int (Array Int Int))) (|v_#memory_int_144| (Array Int (Array Int Int))) (v_append_~head.base_BEFORE_RETURN_4 Int) (|v_#memory_int_145| (Array Int (Array Int Int))) (|v_#memory_int_146| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_179| (Array Int (Array Int Int)))) (let ((.cse17 (+ v_append_~head.offset_BEFORE_RETURN_4 4)) (.cse19 (select |v_#memory_int_144| v_append_~head.base_BEFORE_RETURN_4)) (.cse20 (select |v_#memory_int_146| v_append_~node~0.base_BEFORE_RETURN_4))) (and (= |c_#memory_$Pointer$.offset| (let ((.cse16 (store |v_#memory_$Pointer$.offset_171| v_append_~head.base_BEFORE_RETURN_4 (store (store (select |v_#memory_$Pointer$.offset_171| v_append_~head.base_BEFORE_RETURN_4) v_append_~head.offset_BEFORE_RETURN_4 0) .cse17 0)))) (store .cse16 v_append_~node~0.base_BEFORE_RETURN_4 (store (store (select .cse16 v_append_~node~0.base_BEFORE_RETURN_4) 1 0) 5 0)))) (= |c_#memory_$Pointer$.base| (let ((.cse18 (store |v_#memory_$Pointer$.base_179| v_append_~head.base_BEFORE_RETURN_4 (store (store (select |v_#memory_$Pointer$.base_179| v_append_~head.base_BEFORE_RETURN_4) v_append_~head.offset_BEFORE_RETURN_4 v_append_~node~0.base_BEFORE_RETURN_4) .cse17 v_append_~node~0.base_BEFORE_RETURN_4)))) (store .cse18 v_append_~node~0.base_BEFORE_RETURN_4 (store (store (select .cse18 v_append_~node~0.base_BEFORE_RETURN_4) 1 0) 5 0)))) (= (store |v_#memory_int_144| v_append_~head.base_BEFORE_RETURN_4 (store .cse19 .cse17 (select (select |v_#memory_int_145| v_append_~head.base_BEFORE_RETURN_4) .cse17))) |v_#memory_int_145|) (= (store |v_#memory_int_145| v_append_~node~0.base_BEFORE_RETURN_4 (store (select |v_#memory_int_145| v_append_~node~0.base_BEFORE_RETURN_4) 1 (select .cse20 1))) |v_#memory_int_146|) (<= 0 v_append_~head.offset_BEFORE_RETURN_4) (= (select |c_#valid| v_append_~head.base_BEFORE_RETURN_4) 1) (= (select |c_#valid| v_append_~node~0.base_BEFORE_RETURN_4) 1) (<= 9 (select |c_#length| v_append_~node~0.base_BEFORE_RETURN_4)) (= (store |v_#memory_int_143| v_append_~head.base_BEFORE_RETURN_4 (store (select |v_#memory_int_143| v_append_~head.base_BEFORE_RETURN_4) v_append_~head.offset_BEFORE_RETURN_4 (select .cse19 v_append_~head.offset_BEFORE_RETURN_4))) |v_#memory_int_144|) (<= (+ v_append_~head.offset_BEFORE_RETURN_4 8) (select |c_#length| v_append_~head.base_BEFORE_RETURN_4)) (= (store |v_#memory_int_146| v_append_~node~0.base_BEFORE_RETURN_4 (store .cse20 5 (select (select |c_#memory_int| v_append_~node~0.base_BEFORE_RETURN_4) 5))) |c_#memory_int|)))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 (exists ((|v_old(#memory_int)_AFTER_CALL_8| (Array Int (Array Int Int))) (|v_#memory_int_140| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int)))) (let ((.cse22 (select |v_#memory_int_140| 1)) (.cse21 (select |v_#memory_int_141| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (store |v_#memory_int_141| |c_ULTIMATE.start_main_~list~0#1.base| (store .cse21 4 (select (select |v_old(#memory_int)_AFTER_CALL_8| |c_ULTIMATE.start_main_~list~0#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_8|) (= 48 (select .cse22 0)) (= (select .cse22 1) 0) (= (store |v_#memory_int_140| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |v_#memory_int_140| |c_ULTIMATE.start_main_~list~0#1.base|) 0 (select .cse21 0))) |v_#memory_int_141|))))))) (<= 0 (+ |c_ULTIMATE.start_main_~userInput~1#1| 128))) is different from true [2023-12-02 17:45:21,159 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7698#(and (exists ((|v_#memory_int_148| (Array Int (Array Int Int))) (|v_#memory_int_149| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_149| append_~node~0.base (store (select |v_#memory_int_149| append_~node~0.base) 5 (select (select |#memory_int| append_~node~0.base) 5)))) (= (store |v_#memory_int_148| append_~node~0.base (store (select |v_#memory_int_148| append_~node~0.base) 1 (select (select |v_#memory_int_149| append_~node~0.base) 1))) |v_#memory_int_149|))) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_176| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_176| append_~node~0.base (store (store (select |v_#memory_$Pointer$.offset_176| append_~node~0.base) 1 (select (select |v_#memory_$Pointer$.offset_176| append_~head.base) 4)) 5 0)))) (<= 0 (+ append_~input 128)) (= append_~node~0.offset 0) (<= 0 (+ 128 |append_#in~input|)) (= |append_#t~mem60.base| (select (select |#memory_$Pointer$.base| append_~head.base) 4)) (= |append_#in~head.offset| 0) (= (select |#valid| append_~head.base) 1) (= (select |#valid| append_~node~0.base) 1) (<= append_~input 127) (= append_~head.offset 0) (<= |append_#in~input| 127) (<= 9 (select |#length| append_~node~0.base)) (or (< (select |#length| |append_#t~mem60.base|) (+ |append_#t~mem60.offset| 9)) (< (+ |append_#t~mem60.offset| 5) 0)) (<= 8 (select |#length| append_~head.base)) (exists ((|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_184| append_~node~0.base (store (store (select |v_#memory_$Pointer$.base_184| append_~node~0.base) 1 (select (select |v_#memory_$Pointer$.base_184| append_~head.base) 4)) 5 0)) |#memory_$Pointer$.base|)) (= |append_#t~mem60.offset| (select (select |#memory_$Pointer$.offset| append_~head.base) 4)))' at error location [2023-12-02 17:45:21,159 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:45:21,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:45:21,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 34 [2023-12-02 17:45:21,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506689736] [2023-12-02 17:45:21,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:45:21,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 17:45:21,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:45:21,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 17:45:21,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=3748, Unknown=35, NotChecked=250, Total=4290 [2023-12-02 17:45:21,163 INFO L87 Difference]: Start difference. First operand 349 states and 486 transitions. Second operand has 36 states, 35 states have (on average 1.6) internal successors, (56), 31 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:45:25,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 17:45:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:45:45,924 INFO L93 Difference]: Finished difference Result 994 states and 1167 transitions. [2023-12-02 17:45:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 17:45:45,925 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6) internal successors, (56), 31 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2023-12-02 17:45:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:45:45,934 INFO L225 Difference]: With dead ends: 994 [2023-12-02 17:45:45,934 INFO L226 Difference]: Without dead ends: 994 [2023-12-02 17:45:45,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2238 ImplicationChecksByTransitivity, 450.0s TimeCoverageRelationStatistics Valid=723, Invalid=7806, Unknown=35, NotChecked=366, Total=8930 [2023-12-02 17:45:45,939 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 1773 mSDsluCounter, 2129 mSDsCounter, 0 mSdLazyCounter, 6542 mSolverCounterSat, 326 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1773 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 6869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 6542 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:45:45,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1773 Valid, 2229 Invalid, 6869 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [326 Valid, 6542 Invalid, 1 Unknown, 0 Unchecked, 17.3s Time] [2023-12-02 17:45:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2023-12-02 17:45:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 395. [2023-12-02 17:45:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 245 states have (on average 2.0040816326530613) internal successors, (491), 365 states have internal predecessors, (491), 31 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (61), 30 states have call predecessors, (61), 31 states have call successors, (61) [2023-12-02 17:45:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 583 transitions. [2023-12-02 17:45:45,964 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 583 transitions. Word has length 31 [2023-12-02 17:45:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:45:45,964 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 583 transitions. [2023-12-02 17:45:45,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6) internal successors, (56), 31 states have internal predecessors, (56), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:45:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 583 transitions. [2023-12-02 17:45:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 17:45:45,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:45:45,967 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:45:45,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 17:45:46,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e27cdd78-fe01-43bf-96e8-937e128b385d/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:45:46,169 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-12-02 17:45:46,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:45:46,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1152567184, now seen corresponding path program 1 times [2023-12-02 17:45:46,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:45:46,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629309872] [2023-12-02 17:45:46,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:45:46,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:45:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat