./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/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_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/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_58df2a26-43e8-4eec-b688-313b6592ba52/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 6e9221de91e231efa38b63f264828813e89f68c8ac306a629b3513c0e7bf1ed0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:16:24,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:16:24,597 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 13:16:24,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:16:24,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:16:24,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:16:24,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:16:24,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:16:24,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:16:24,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:16:24,645 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:16:24,645 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:16:24,646 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:16:24,646 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:16:24,647 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:16:24,647 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:16:24,648 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:16:24,648 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:16:24,649 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:16:24,649 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:16:24,650 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:16:24,650 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:16:24,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 13:16:24,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 13:16:24,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:16:24,652 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:16:24,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:16:24,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:16:24,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:16:24,654 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 13:16:24,654 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 13:16:24,655 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 13:16:24,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:16:24,655 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 13:16:24,655 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 13:16:24,656 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:16:24,656 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:16:24,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:16:24,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:16:24,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:16:24,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:16:24,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:16:24,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:16:24,658 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:16:24,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:16:24,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:16:24,658 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:16:24,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:16:24,658 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_58df2a26-43e8-4eec-b688-313b6592ba52/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_58df2a26-43e8-4eec-b688-313b6592ba52/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 -> 6e9221de91e231efa38b63f264828813e89f68c8ac306a629b3513c0e7bf1ed0 [2023-12-02 13:16:24,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:16:24,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:16:24,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:16:24,925 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:16:24,928 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:16:24,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2023-12-02 13:16:27,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:16:27,906 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:16:27,907 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2023-12-02 13:16:27,918 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/data/5a5531d40/dd632384ac1343a39d775a608a047761/FLAG7f10a631e [2023-12-02 13:16:27,930 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/data/5a5531d40/dd632384ac1343a39d775a608a047761 [2023-12-02 13:16:27,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:16:27,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:16:27,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:16:27,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:16:27,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:16:27,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:16:27" (1/1) ... [2023-12-02 13:16:27,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:27, skipping insertion in model container [2023-12-02 13:16:27,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:16:27" (1/1) ... [2023-12-02 13:16:27,984 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:16:28,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:16:28,248 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:16:28,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:16:28,324 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:16:28,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28 WrapperNode [2023-12-02 13:16:28,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:16:28,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:16:28,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:16:28,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:16:28,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28" (1/1) ... [2023-12-02 13:16:28,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28" (1/1) ... [2023-12-02 13:16:28,373 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 102 [2023-12-02 13:16:28,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:16:28,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:16:28,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:16:28,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:16:28,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28" (1/1) ... [2023-12-02 13:16:28,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28" (1/1) ... [2023-12-02 13:16:28,389 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28" (1/1) ... [2023-12-02 13:16:28,389 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28" (1/1) ... [2023-12-02 13:16:28,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28" (1/1) ... [2023-12-02 13:16:28,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28" (1/1) ... [2023-12-02 13:16:28,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28" (1/1) ... [2023-12-02 13:16:28,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28" (1/1) ... [2023-12-02 13:16:28,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:16:28,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:16:28,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:16:28,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:16:28,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28" (1/1) ... [2023-12-02 13:16:28,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:16:28,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:16:28,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:16:28,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:16:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 13:16:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 13:16:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:16:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 13:16:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 13:16:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 13:16:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 13:16:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:16:28,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:16:28,475 INFO L130 BoogieDeclarations]: Found specification of procedure append [2023-12-02 13:16:28,475 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2023-12-02 13:16:28,564 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:16:28,565 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:16:28,886 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:16:28,933 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:16:28,934 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 13:16:28,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:16:28 BoogieIcfgContainer [2023-12-02 13:16:28,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:16:28,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:16:28,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:16:28,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:16:28,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:16:27" (1/3) ... [2023-12-02 13:16:28,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfb00a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:16:28, skipping insertion in model container [2023-12-02 13:16:28,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:16:28" (2/3) ... [2023-12-02 13:16:28,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfb00a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:16:28, skipping insertion in model container [2023-12-02 13:16:28,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:16:28" (3/3) ... [2023-12-02 13:16:28,944 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-1.i [2023-12-02 13:16:28,958 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:16:28,958 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-12-02 13:16:29,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:16:29,008 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;@2a1f94da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:16:29,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-12-02 13:16:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 49 states have (on average 2.3469387755102042) internal successors, (115), 108 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:16:29,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 13:16:29,016 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:29,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 13:16:29,017 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:16:29,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:29,021 INFO L85 PathProgramCache]: Analyzing trace with hash 7010, now seen corresponding path program 1 times [2023-12-02 13:16:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:29,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184751520] [2023-12-02 13:16:29,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:29,182 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 13:16:29,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:29,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184751520] [2023-12-02 13:16:29,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184751520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:16:29,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:16:29,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:16:29,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638700622] [2023-12-02 13:16:29,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:16:29,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:16:29,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:16:29,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:16:29,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:16:29,217 INFO L87 Difference]: Start difference. First operand has 112 states, 49 states have (on average 2.3469387755102042) internal successors, (115), 108 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 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 13:16:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:29,371 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2023-12-02 13:16:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:16:29,373 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 13:16:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:29,381 INFO L225 Difference]: With dead ends: 144 [2023-12-02 13:16:29,381 INFO L226 Difference]: Without dead ends: 143 [2023-12-02 13:16:29,383 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 13:16:29,386 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 44 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:29,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 127 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:16:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-12-02 13:16:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 109. [2023-12-02 13:16:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 105 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:16:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2023-12-02 13:16:29,425 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 2 [2023-12-02 13:16:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:29,425 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2023-12-02 13:16:29,425 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 13:16:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2023-12-02 13:16:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 13:16:29,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:29,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 13:16:29,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 13:16:29,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:16:29,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash 7011, now seen corresponding path program 1 times [2023-12-02 13:16:29,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:29,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039451472] [2023-12-02 13:16:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:29,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:29,515 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 13:16:29,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:29,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039451472] [2023-12-02 13:16:29,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039451472] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:16:29,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:16:29,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:16:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430772373] [2023-12-02 13:16:29,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:16:29,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:16:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:16:29,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:16:29,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:16:29,519 INFO L87 Difference]: Start difference. First operand 109 states and 115 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 13:16:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:29,657 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2023-12-02 13:16:29,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:16:29,658 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 13:16:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:29,659 INFO L225 Difference]: With dead ends: 109 [2023-12-02 13:16:29,659 INFO L226 Difference]: Without dead ends: 109 [2023-12-02 13:16:29,660 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 13:16:29,661 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:29,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 142 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:16:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-02 13:16:29,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2023-12-02 13:16:29,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 103 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:16:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2023-12-02 13:16:29,674 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 2 [2023-12-02 13:16:29,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:29,674 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2023-12-02 13:16:29,674 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 13:16:29,674 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2023-12-02 13:16:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 13:16:29,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:29,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 13:16:29,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 13:16:29,675 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:16:29,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash 6741643, now seen corresponding path program 1 times [2023-12-02 13:16:29,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:29,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468170312] [2023-12-02 13:16:29,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:29,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:29,745 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 13:16:29,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:29,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468170312] [2023-12-02 13:16:29,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468170312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:16:29,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:16:29,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:16:29,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982518912] [2023-12-02 13:16:29,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:16:29,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:16:29,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:16:29,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:16:29,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:16:29,748 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 13:16:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:29,857 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2023-12-02 13:16:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:16:29,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-12-02 13:16:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:29,859 INFO L225 Difference]: With dead ends: 122 [2023-12-02 13:16:29,860 INFO L226 Difference]: Without dead ends: 122 [2023-12-02 13:16:29,860 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 13:16:29,861 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 22 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:29,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 130 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:16:29,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-02 13:16:29,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 109. [2023-12-02 13:16:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 53 states have (on average 2.150943396226415) internal successors, (114), 105 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:16:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2023-12-02 13:16:29,873 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 4 [2023-12-02 13:16:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:29,873 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2023-12-02 13:16:29,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 13:16:29,873 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2023-12-02 13:16:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 13:16:29,874 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:29,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 13:16:29,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 13:16:29,874 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:16:29,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash 6741644, now seen corresponding path program 1 times [2023-12-02 13:16:29,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:29,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340975499] [2023-12-02 13:16:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:29,961 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 13:16:29,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:29,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340975499] [2023-12-02 13:16:29,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340975499] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:16:29,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:16:29,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:16:29,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896515799] [2023-12-02 13:16:29,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:16:29,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:16:29,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:16:29,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:16:29,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:16:29,964 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 13:16:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:30,056 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2023-12-02 13:16:30,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:16:30,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2023-12-02 13:16:30,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:30,059 INFO L225 Difference]: With dead ends: 109 [2023-12-02 13:16:30,059 INFO L226 Difference]: Without dead ends: 109 [2023-12-02 13:16:30,059 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 13:16:30,061 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:30,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 141 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:16:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-02 13:16:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2023-12-02 13:16:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 53 states have (on average 2.1132075471698113) internal successors, (112), 103 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:16:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2023-12-02 13:16:30,070 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 4 [2023-12-02 13:16:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:30,070 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2023-12-02 13:16:30,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 13:16:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2023-12-02 13:16:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 13:16:30,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:30,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:16:30,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 13:16:30,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:16:30,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:30,072 INFO L85 PathProgramCache]: Analyzing trace with hash 429166719, now seen corresponding path program 1 times [2023-12-02 13:16:30,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:30,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81749595] [2023-12-02 13:16:30,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:30,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:30,148 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 13:16:30,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:30,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81749595] [2023-12-02 13:16:30,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81749595] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:16:30,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:16:30,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:16:30,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147229390] [2023-12-02 13:16:30,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:16:30,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:16:30,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:16:30,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:16:30,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:16:30,151 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 13:16:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:30,244 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2023-12-02 13:16:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:16:30,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 13:16:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:30,245 INFO L225 Difference]: With dead ends: 102 [2023-12-02 13:16:30,246 INFO L226 Difference]: Without dead ends: 102 [2023-12-02 13:16:30,246 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 13:16:30,247 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 39 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:30,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 96 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:16:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-02 13:16:30,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-12-02 13:16:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 53 states have (on average 2.018867924528302) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:16:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2023-12-02 13:16:30,256 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 9 [2023-12-02 13:16:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:30,256 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2023-12-02 13:16:30,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 13:16:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2023-12-02 13:16:30,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 13:16:30,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:30,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:16:30,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 13:16:30,258 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:16:30,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:30,258 INFO L85 PathProgramCache]: Analyzing trace with hash 429166720, now seen corresponding path program 1 times [2023-12-02 13:16:30,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:30,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489365180] [2023-12-02 13:16:30,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:30,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:30,344 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 13:16:30,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:30,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489365180] [2023-12-02 13:16:30,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489365180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:16:30,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:16:30,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:16:30,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681384618] [2023-12-02 13:16:30,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:16:30,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:16:30,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:16:30,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:16:30,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:16:30,347 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 13:16:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:30,420 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2023-12-02 13:16:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:16:30,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 13:16:30,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:30,422 INFO L225 Difference]: With dead ends: 97 [2023-12-02 13:16:30,422 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 13:16:30,423 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 13:16:30,424 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:30,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 104 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:16:30,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 13:16:30,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-12-02 13:16:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 93 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:16:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2023-12-02 13:16:30,431 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 9 [2023-12-02 13:16:30,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:30,432 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2023-12-02 13:16:30,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 13:16:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2023-12-02 13:16:30,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 13:16:30,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:30,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:16:30,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 13:16:30,433 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:16:30,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:30,434 INFO L85 PathProgramCache]: Analyzing trace with hash 419266502, now seen corresponding path program 1 times [2023-12-02 13:16:30,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:30,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935355671] [2023-12-02 13:16:30,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:30,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:30,627 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 13:16:30,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:30,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935355671] [2023-12-02 13:16:30,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935355671] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:16:30,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:16:30,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:16:30,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670868288] [2023-12-02 13:16:30,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:16:30,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:16:30,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:16:30,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:16:30,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:16:30,629 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13:16:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:30,897 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2023-12-02 13:16:30,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:16:30,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 10 [2023-12-02 13:16:30,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:30,899 INFO L225 Difference]: With dead ends: 191 [2023-12-02 13:16:30,899 INFO L226 Difference]: Without dead ends: 191 [2023-12-02 13:16:30,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:16:30,901 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 202 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:30,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 161 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:16:30,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-02 13:16:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 122. [2023-12-02 13:16:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 83 states have (on average 1.819277108433735) internal successors, (151), 117 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:16:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 155 transitions. [2023-12-02 13:16:30,910 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 155 transitions. Word has length 10 [2023-12-02 13:16:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:30,910 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 155 transitions. [2023-12-02 13:16:30,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13:16:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 155 transitions. [2023-12-02 13:16:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 13:16:30,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:30,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:16:30,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 13:16:30,911 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:16:30,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash 419266503, now seen corresponding path program 1 times [2023-12-02 13:16:30,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:30,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236512712] [2023-12-02 13:16:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:30,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:31,165 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 13:16:31,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:31,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236512712] [2023-12-02 13:16:31,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236512712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:16:31,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:16:31,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:16:31,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991207729] [2023-12-02 13:16:31,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:16:31,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:16:31,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:16:31,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:16:31,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:16:31,167 INFO L87 Difference]: Start difference. First operand 122 states and 155 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13:16:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:31,341 INFO L93 Difference]: Finished difference Result 144 states and 179 transitions. [2023-12-02 13:16:31,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:16:31,342 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 10 [2023-12-02 13:16:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:31,343 INFO L225 Difference]: With dead ends: 144 [2023-12-02 13:16:31,343 INFO L226 Difference]: Without dead ends: 144 [2023-12-02 13:16:31,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:16:31,344 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:31,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 194 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:16:31,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-02 13:16:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2023-12-02 13:16:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 136 states have internal predecessors, (173), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:16:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 179 transitions. [2023-12-02 13:16:31,352 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 179 transitions. Word has length 10 [2023-12-02 13:16:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:31,353 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 179 transitions. [2023-12-02 13:16:31,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 13:16:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 179 transitions. [2023-12-02 13:16:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 13:16:31,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:31,354 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 13:16:31,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 13:16:31,354 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:16:31,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash 614000174, now seen corresponding path program 1 times [2023-12-02 13:16:31,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:31,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061154189] [2023-12-02 13:16:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:31,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:31,850 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 13:16:31,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:31,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061154189] [2023-12-02 13:16:31,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061154189] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:16:31,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:16:31,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 13:16:31,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993658255] [2023-12-02 13:16:31,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:16:31,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 13:16:31,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:16:31,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 13:16:31,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:16:31,852 INFO L87 Difference]: Start difference. First operand 142 states and 179 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 13:16:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:32,125 INFO L93 Difference]: Finished difference Result 175 states and 211 transitions. [2023-12-02 13:16:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 13:16:32,128 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 13:16:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:32,129 INFO L225 Difference]: With dead ends: 175 [2023-12-02 13:16:32,129 INFO L226 Difference]: Without dead ends: 175 [2023-12-02 13:16:32,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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 13:16:32,130 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 54 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:32,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 314 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:16:32,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-02 13:16:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 142. [2023-12-02 13:16:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 101 states have (on average 1.702970297029703) internal successors, (172), 136 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:16:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2023-12-02 13:16:32,137 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 17 [2023-12-02 13:16:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:32,138 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2023-12-02 13:16:32,138 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 13:16:32,138 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2023-12-02 13:16:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 13:16:32,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:32,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:16:32,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 13:16:32,139 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:16:32,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:32,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1065709104, now seen corresponding path program 1 times [2023-12-02 13:16:32,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:32,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626819427] [2023-12-02 13:16:32,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:32,691 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 13:16:32,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:32,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626819427] [2023-12-02 13:16:32,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626819427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:16:32,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:16:32,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 13:16:32,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774720840] [2023-12-02 13:16:32,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:16:32,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 13:16:32,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:16:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 13:16:32,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:16:32,693 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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 13:16:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:32,971 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2023-12-02 13:16:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:16:32,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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 18 [2023-12-02 13:16:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:32,973 INFO L225 Difference]: With dead ends: 136 [2023-12-02 13:16:32,973 INFO L226 Difference]: Without dead ends: 136 [2023-12-02 13:16:32,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:16:32,974 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 5 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:32,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 353 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:16:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-02 13:16:32,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-12-02 13:16:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 95 states have (on average 1.7157894736842105) internal successors, (163), 130 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:16:32,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 169 transitions. [2023-12-02 13:16:32,979 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 169 transitions. Word has length 18 [2023-12-02 13:16:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:32,980 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 169 transitions. [2023-12-02 13:16:32,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 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 13:16:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2023-12-02 13:16:32,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 13:16:32,981 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:32,981 INFO L195 NwaCegarLoop]: trace histogram [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 13:16:32,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 13:16:32,981 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:16:32,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:32,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1415007606, now seen corresponding path program 1 times [2023-12-02 13:16:32,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:32,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837619775] [2023-12-02 13:16:32,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:32,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:33,057 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 13:16:33,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837619775] [2023-12-02 13:16:33,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837619775] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:16:33,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:16:33,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:16:33,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157434025] [2023-12-02 13:16:33,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:16:33,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:16:33,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:16:33,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:16:33,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:16:33,060 INFO L87 Difference]: Start difference. First operand 136 states and 169 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 13:16:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:16:33,101 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2023-12-02 13:16:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:16:33,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-12-02 13:16:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:16:33,102 INFO L225 Difference]: With dead ends: 132 [2023-12-02 13:16:33,103 INFO L226 Difference]: Without dead ends: 132 [2023-12-02 13:16:33,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:16:33,104 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:16:33,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 143 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:16:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-02 13:16:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2023-12-02 13:16:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 80 states have (on average 1.6375) internal successors, (131), 115 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:16:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2023-12-02 13:16:33,109 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 24 [2023-12-02 13:16:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:16:33,109 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2023-12-02 13:16:33,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 13:16:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2023-12-02 13:16:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 13:16:33,110 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:16:33,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:16:33,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 13:16:33,110 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:16:33,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:16:33,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1637619411, now seen corresponding path program 1 times [2023-12-02 13:16:33,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:16:33,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921659820] [2023-12-02 13:16:33,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:33,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:16:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:16:33,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:16:33,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921659820] [2023-12-02 13:16:33,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921659820] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:16:33,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953703632] [2023-12-02 13:16:33,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:16:33,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:16:33,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:16:33,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:16:33,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 13:16:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:16:33,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-02 13:16:33,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:16:33,843 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 13:16:33,900 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 13:16:33,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 13:16:33,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:16:34,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:16:34,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:16:34,183 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 13:16:34,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 13:16:34,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:16:34,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 13:16:34,270 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 13:16:34,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 13:16:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 13:16:34,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:16:34,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:16:34,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2023-12-02 13:16:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953703632] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:16:34,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1121636459] [2023-12-02 13:16:34,771 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 13:16:34,771 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:16:34,776 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:16:34,781 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:16:34,781 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:16:41,407 INFO L197 IcfgInterpreter]: Interpreting procedure append with input of size 134 for LOIs [2023-12-02 13:16:42,358 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:17:36,201 WARN L293 SmtUtils]: Spent 7.96s on a formula simplification. DAG size of input: 224 DAG size of output: 215 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:18:01,553 WARN L293 SmtUtils]: Spent 9.05s on a formula simplification. DAG size of input: 232 DAG size of output: 224 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:18:02,478 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3054#(and (= 0 (select |old(#valid)| append_~node~0.base)) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_#t~nondet11#1_16| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet11#1_16| 0)) (<= |v_ULTIMATE.start_main_#t~nondet11#1_16| 2147483647) (<= 0 (+ 2147483648 |v_ULTIMATE.start_main_#t~nondet11#1_16|)))) (= (store |old(#memory_$Pointer$.base)| append_~node~0.base (store (select |old(#memory_$Pointer$.base)| append_~node~0.base) 0 (select (select |#memory_$Pointer$.base| append_~node~0.base) 0))) |#memory_$Pointer$.base|) (not (= append_~node~0.base 0)) (= append_~node~0.offset 0) (<= 0 (+ 128 |append_#in~input|)) (= (store |old(#length)| append_~node~0.base 9) |#length|) (= |append_#in~head.offset| 0) (= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| append_~node~0.base (store (select |old(#memory_$Pointer$.offset)| append_~node~0.base) 0 (select (select |#memory_$Pointer$.offset| append_~node~0.base) 0)))) (= append_~head.base |append_#in~head.base|) (<= (select |#length| append_~head.base) 3) (<= (+ append_~node~0.base 1) |#StackHeapBarrier|) (= |#memory_int| (store |old(#memory_int)| append_~node~0.base (store (select |old(#memory_int)| append_~node~0.base) 0 append_~input))) (= |#valid| (store |old(#valid)| append_~node~0.base 1)) (= append_~head.offset 0) (= append_~input |append_#in~input|) (<= |append_#in~input| 127))' at error location [2023-12-02 13:18:02,478 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:18:02,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 13:18:02,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 16 [2023-12-02 13:18:02,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328798594] [2023-12-02 13:18:02,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 13:18:02,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 13:18:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:18:02,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 13:18:02,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1320, Unknown=21, NotChecked=0, Total=1560 [2023-12-02 13:18:02,480 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 3 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 13:18:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:18:04,001 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2023-12-02 13:18:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:18:04,001 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 3 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 26 [2023-12-02 13:18:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:18:04,003 INFO L225 Difference]: With dead ends: 156 [2023-12-02 13:18:04,003 INFO L226 Difference]: Without dead ends: 156 [2023-12-02 13:18:04,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 80.9s TimeCoverageRelationStatistics Valid=315, Invalid=1826, Unknown=21, NotChecked=0, Total=2162 [2023-12-02 13:18:04,005 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 297 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:18:04,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 404 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 13:18:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-02 13:18:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 120. [2023-12-02 13:18:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.5375) internal successors, (123), 114 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 13:18:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2023-12-02 13:18:04,010 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 26 [2023-12-02 13:18:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:18:04,011 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2023-12-02 13:18:04,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 3 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 13:18:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2023-12-02 13:18:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 13:18:04,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:18:04,012 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:18:04,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 13:18:04,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 13:18:04,213 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-12-02 13:18:04,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:18:04,213 INFO L85 PathProgramCache]: Analyzing trace with hash -757941946, now seen corresponding path program 1 times [2023-12-02 13:18:04,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:18:04,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989921865] [2023-12-02 13:18:04,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:18:04,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:18:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:18:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:18:04,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:18:04,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989921865] [2023-12-02 13:18:04,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989921865] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:18:04,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940577261] [2023-12-02 13:18:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:18:04,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:18:04,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:18:04,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:18:04,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58df2a26-43e8-4eec-b688-313b6592ba52/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 13:18:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:18:04,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-02 13:18:04,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:18:04,736 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 13:18:04,764 WARN L876 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2023-12-02 13:18:04,874 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 13:18:04,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 13:18:04,907 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 13:18:04,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 13:18:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 13:18:04,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:18:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940577261] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:18:05,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1975458919] [2023-12-02 13:18:05,043 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 13:18:05,044 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:18:05,044 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:18:05,044 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:18:05,044 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:18:07,700 INFO L197 IcfgInterpreter]: Interpreting procedure append with input of size 339 for LOIs [2023-12-02 13:18:27,338 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:18:29,354 WARN L854 $PredicateComparison]: unable to prove that (and (<= |c_append_#in~input| 127) (= |c_append_#in~input| c_append_~input) (= c_append_~head.offset 0) (<= 0 (+ 128 |c_append_#in~input|)) (<= 1 |c_#StackHeapBarrier|) (exists ((|v_#valid_135| (Array Int Int)) (|v_#memory_$Pointer$.base_114| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int))) (|v_#length_110| (Array Int Int)) (|v_#memory_$Pointer$.offset_114| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_91| c_append_~node~0.base (store (select |v_#memory_int_91| c_append_~node~0.base) 0 c_append_~input)) |c_#memory_int|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_114| c_append_~node~0.base (store (select |v_#memory_$Pointer$.base_114| c_append_~node~0.base) 0 (select (select |c_#memory_$Pointer$.base| c_append_~node~0.base) 0)))) (let ((.cse0 (= |c_old(#length)| |v_#length_110|)) (.cse1 (= |v_#memory_$Pointer$.base_114| |c_old(#memory_$Pointer$.base)|)) (.cse34 (= |c_old(#memory_int)| |v_#memory_int_91|)) (.cse8 (not (= |c_append_#in~head.base| 0))) (.cse35 (= |v_#valid_135| |c_old(#valid)|)) (.cse12 (<= (+ |c_append_#in~head.base| 1) |c_#StackHeapBarrier|)) (.cse36 (= |v_#memory_$Pointer$.offset_114| |c_old(#memory_$Pointer$.offset)|))) (or (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_main_~userInput~1#1_18| Int) (|v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_main_~userInput~1#1_18|)) (<= |v_ULTIMATE.start_main_~userInput~1#1_18| 127) (let ((.cse2 (= (select |c_old(#valid)| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 1)) (.cse6 (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_10| 2) 1)) (.cse7 (= (select (store |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_10| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| 1) |c_append_#in~head.base|) 0)) (.cse9 (<= (+ |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| 1) |c_#StackHeapBarrier|)) (.cse10 (not (= |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| 0))) (.cse11 (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_10| 1) 1)) (.cse13 (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_10| 0) 0)) (.cse14 (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_10| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 0)) (.cse15 (exists ((|v_#length_107| (Array Int Int))) (and (= (select |v_#length_107| 2) 18) (= 2 (select |v_#length_107| 1))))) (.cse23 (<= 8 (select |c_old(#length)| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)))) (or (and .cse2 (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_12| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_85| |c_append_#in~head.base|)) (.cse5 (select |v_#memory_int_83| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)) (.cse3 (select |v_#memory_int_82| 1))) (and (= 48 (select .cse3 0)) (= (store |v_#memory_int_84| |c_append_#in~head.base| (store (select |v_#memory_int_84| |c_append_#in~head.base|) 0 (select .cse4 0))) |v_#memory_int_85|) (= |v_#memory_int_83| (store |v_#memory_int_82| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (select |v_#memory_int_82| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 0 (select .cse5 0)))) (= |v_old(#memory_int)_AFTER_CALL_12| (store |v_#memory_int_85| |c_append_#in~head.base| (store .cse4 4 (select (select |v_old(#memory_int)_AFTER_CALL_12| |c_append_#in~head.base|) 4)))) (= |v_#memory_int_84| (store |v_#memory_int_83| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store .cse5 4 (select (select |v_#memory_int_84| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 4)))) (= (select .cse3 1) 0)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_109| (Array Int (Array Int Int))) (|v_#memory_int_89| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_109| (Array Int (Array Int Int))) (|v_#valid_134| (Array Int Int)) (|v_#length_109| (Array Int Int)) (|v_#memory_$Pointer$.offset_110| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_110| (Array Int (Array Int Int))) (v_append_~node~0.base_BEFORE_RETURN_8 Int)) (let ((.cse16 (select |v_#memory_int_90| v_append_~node~0.base_BEFORE_RETURN_8)) (.cse20 (select |v_#memory_int_88| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)) (.cse18 (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)) (.cse17 (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|))) (and (= |c_old(#memory_int)| (store |v_#memory_int_90| v_append_~node~0.base_BEFORE_RETURN_8 (store .cse16 5 (select (select |c_old(#memory_int)| v_append_~node~0.base_BEFORE_RETURN_8) 5)))) (= (select .cse17 4) 0) (= (select .cse18 4) 0) (= (store |v_#memory_$Pointer$.base_109| v_append_~node~0.base_BEFORE_RETURN_8 (store (select |v_#memory_$Pointer$.base_109| v_append_~node~0.base_BEFORE_RETURN_8) 0 (select (select |v_#memory_$Pointer$.base_110| v_append_~node~0.base_BEFORE_RETURN_8) 0))) |v_#memory_$Pointer$.base_110|) (not (= v_append_~node~0.base_BEFORE_RETURN_8 0)) (= (select .cse17 0) 0) (<= (+ v_append_~node~0.base_BEFORE_RETURN_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_134| v_append_~node~0.base_BEFORE_RETURN_8) 0) (= (store |v_#valid_134| v_append_~node~0.base_BEFORE_RETURN_8 1) |c_old(#valid)|) (= (let ((.cse19 (store |v_#memory_int_86| v_append_~node~0.base_BEFORE_RETURN_8 (store (select |v_#memory_int_86| v_append_~node~0.base_BEFORE_RETURN_8) 0 |v_ULTIMATE.start_main_~userInput~1#1_18|)))) (store .cse19 |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (select .cse19 |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 0 (select .cse20 0)))) |v_#memory_int_88|) (= (store |v_#length_109| v_append_~node~0.base_BEFORE_RETURN_8 9) |c_old(#length)|) (= |v_#memory_int_90| (store |v_#memory_int_89| v_append_~node~0.base_BEFORE_RETURN_8 (store (select |v_#memory_int_89| v_append_~node~0.base_BEFORE_RETURN_8) 1 (select .cse16 1)))) (= |v_#memory_int_89| (store |v_#memory_int_88| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store .cse20 4 (select (select |v_#memory_int_89| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 4)))) (= (let ((.cse21 (store |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (store .cse18 0 v_append_~node~0.base_BEFORE_RETURN_8) 4 v_append_~node~0.base_BEFORE_RETURN_8)))) (store .cse21 v_append_~node~0.base_BEFORE_RETURN_8 (store (store (select .cse21 v_append_~node~0.base_BEFORE_RETURN_8) 1 0) 5 0))) |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| v_append_~node~0.base_BEFORE_RETURN_8) 1) (= (select .cse18 0) 0) (<= 9 (select |c_old(#length)| v_append_~node~0.base_BEFORE_RETURN_8)) (= |v_#memory_$Pointer$.offset_110| (store |v_#memory_$Pointer$.offset_109| v_append_~node~0.base_BEFORE_RETURN_8 (store (select |v_#memory_$Pointer$.offset_109| v_append_~node~0.base_BEFORE_RETURN_8) 0 (select (select |v_#memory_$Pointer$.offset_110| v_append_~node~0.base_BEFORE_RETURN_8) 0)))) (= (let ((.cse22 (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (store .cse17 0 0) 4 0)))) (store .cse22 v_append_~node~0.base_BEFORE_RETURN_8 (store (store (select .cse22 v_append_~node~0.base_BEFORE_RETURN_8) 1 0) 5 0))) |c_old(#memory_$Pointer$.offset)|)))) .cse23) (and .cse2 (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_109| (Array Int (Array Int Int))) (|v_#memory_int_89| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_109| (Array Int (Array Int Int))) (|v_#valid_134| (Array Int Int)) (|v_#length_109| (Array Int Int)) (|v_#memory_$Pointer$.offset_110| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_110| (Array Int (Array Int Int))) (v_append_~node~0.base_BEFORE_RETURN_7 Int)) (let ((.cse24 (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)) (.cse27 (select |v_#memory_int_90| v_append_~node~0.base_BEFORE_RETURN_7)) (.cse28 (select |v_#memory_int_88| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)) (.cse25 (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|))) (and (= (select .cse24 4) 0) (= (select .cse25 4) 0) (= (store |v_#length_109| v_append_~node~0.base_BEFORE_RETURN_7 9) |c_old(#length)|) (= (select .cse24 0) 0) (= (select |v_#valid_134| v_append_~node~0.base_BEFORE_RETURN_7) 0) (= (let ((.cse26 (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (store .cse24 0 0) 4 0)))) (store .cse26 v_append_~node~0.base_BEFORE_RETURN_7 (store (store (select .cse26 v_append_~node~0.base_BEFORE_RETURN_7) 1 0) 5 0))) |c_old(#memory_$Pointer$.offset)|) (= |c_old(#valid)| (store |v_#valid_134| v_append_~node~0.base_BEFORE_RETURN_7 1)) (= (select |c_old(#valid)| v_append_~node~0.base_BEFORE_RETURN_7) 1) (<= (+ v_append_~node~0.base_BEFORE_RETURN_7 1) |c_#StackHeapBarrier|) (= |v_#memory_int_90| (store |v_#memory_int_89| v_append_~node~0.base_BEFORE_RETURN_7 (store (select |v_#memory_int_89| v_append_~node~0.base_BEFORE_RETURN_7) 1 (select .cse27 1)))) (= (store |v_#memory_$Pointer$.offset_109| v_append_~node~0.base_BEFORE_RETURN_7 (store (select |v_#memory_$Pointer$.offset_109| v_append_~node~0.base_BEFORE_RETURN_7) 0 (select (select |v_#memory_$Pointer$.offset_110| v_append_~node~0.base_BEFORE_RETURN_7) 0))) |v_#memory_$Pointer$.offset_110|) (= (store |v_#memory_int_90| v_append_~node~0.base_BEFORE_RETURN_7 (store .cse27 5 (select (select |c_old(#memory_int)| v_append_~node~0.base_BEFORE_RETURN_7) 5))) |c_old(#memory_int)|) (= |v_#memory_int_89| (store |v_#memory_int_88| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store .cse28 4 (select (select |v_#memory_int_89| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 4)))) (not (= v_append_~node~0.base_BEFORE_RETURN_7 0)) (= (store |v_#memory_$Pointer$.base_109| v_append_~node~0.base_BEFORE_RETURN_7 (store (select |v_#memory_$Pointer$.base_109| v_append_~node~0.base_BEFORE_RETURN_7) 0 (select (select |v_#memory_$Pointer$.base_110| v_append_~node~0.base_BEFORE_RETURN_7) 0))) |v_#memory_$Pointer$.base_110|) (<= 9 (select |c_old(#length)| v_append_~node~0.base_BEFORE_RETURN_7)) (= (select .cse25 0) 0) (= |v_#memory_int_88| (let ((.cse29 (store |v_#memory_int_86| v_append_~node~0.base_BEFORE_RETURN_7 (store (select |v_#memory_int_86| v_append_~node~0.base_BEFORE_RETURN_7) 0 |v_ULTIMATE.start_main_~userInput~1#1_18|)))) (store .cse29 |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (select .cse29 |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 0 (select .cse28 0))))) (= (let ((.cse30 (store |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (store .cse25 0 v_append_~node~0.base_BEFORE_RETURN_7) 4 v_append_~node~0.base_BEFORE_RETURN_7)))) (store .cse30 v_append_~node~0.base_BEFORE_RETURN_7 (store (store (select .cse30 v_append_~node~0.base_BEFORE_RETURN_7) 1 0) 5 0))) |c_old(#memory_$Pointer$.base)|)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_11| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_int_85| |c_append_#in~head.base|)) (.cse33 (select |v_#memory_int_83| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)) (.cse32 (select |v_#memory_int_82| 1))) (and (= |v_old(#memory_int)_AFTER_CALL_11| (store |v_#memory_int_85| |c_append_#in~head.base| (store .cse31 4 (select (select |v_old(#memory_int)_AFTER_CALL_11| |c_append_#in~head.base|) 4)))) (= 48 (select .cse32 0)) (= (store |v_#memory_int_84| |c_append_#in~head.base| (store (select |v_#memory_int_84| |c_append_#in~head.base|) 0 (select .cse31 0))) |v_#memory_int_85|) (= |v_#memory_int_83| (store |v_#memory_int_82| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (select |v_#memory_int_82| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 0 (select .cse33 0)))) (= |v_#memory_int_84| (store |v_#memory_int_83| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store .cse33 4 (select (select |v_#memory_int_84| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 4)))) (= (select .cse32 1) 0)))) .cse23))))) .cse34 .cse35 .cse36) (and .cse0 .cse1 (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#length_107| (Array Int Int)) (|v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| (Array Int Int)) (|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (let ((.cse40 (select |v_#memory_int_85| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|)) (.cse41 (store |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| |c_append_#in~head.base| 1)) (.cse38 (select |v_#memory_int_82| 1)) (.cse37 (select |v_#memory_int_83| |c_append_#in~head.base|))) (and (= (select |v_#length_107| 2) 18) (= |v_#memory_int_83| (store |v_#memory_int_82| |c_append_#in~head.base| (store (select |v_#memory_int_82| |c_append_#in~head.base|) 0 (select .cse37 0)))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| |c_append_#in~head.base|) 0) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| 1) 1) (= 48 (select .cse38 0)) (= |c_old(#memory_$Pointer$.base)| (let ((.cse39 (store |v_#memory_$Pointer$.base_105| |c_append_#in~head.base| (store (store (select |v_#memory_$Pointer$.base_105| |c_append_#in~head.base|) 0 0) 4 0)))) (store .cse39 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| (store (store (select .cse39 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|) 0 0) 4 0)))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| 2) 1) (= |c_old(#length)| (store (store |v_#length_107| |c_append_#in~head.base| 8) |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| 8)) (= (store |v_#memory_int_84| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| (store (select |v_#memory_int_84| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|) 0 (select .cse40 0))) |v_#memory_int_85|) (= (store .cse41 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| 1) |c_old(#valid)|) (<= (+ |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| 1) |c_#StackHeapBarrier|) (= (store |v_#memory_int_85| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| (store .cse40 4 (select (select |c_old(#memory_int)| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|) 4))) |c_old(#memory_int)|) (= |c_old(#memory_$Pointer$.offset)| (let ((.cse42 (store |v_#memory_$Pointer$.offset_105| |c_append_#in~head.base| (store (store (select |v_#memory_$Pointer$.offset_105| |c_append_#in~head.base|) 0 0) 4 0)))) (store .cse42 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| (store (store (select .cse42 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|) 0 0) 4 0)))) (not (= |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| 0)) (= (select .cse41 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|) 0) (= (select .cse38 1) 0) (= 2 (select |v_#length_107| 1)) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| 0) 0) (= |v_#memory_int_84| (store |v_#memory_int_83| |c_append_#in~head.base| (store .cse37 4 (select (select |v_#memory_int_84| |c_append_#in~head.base|) 4)))) (<= 8 (select |c_old(#length)| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|))))) .cse34 .cse8 .cse35 .cse12 .cse36))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_114| c_append_~node~0.base (store (select |v_#memory_$Pointer$.offset_114| c_append_~node~0.base) 0 (select (select |c_#memory_$Pointer$.offset| c_append_~node~0.base) 0)))) (= (select |v_#valid_135| c_append_~node~0.base) 0) (= (store |v_#length_110| c_append_~node~0.base 9) |c_#length|) (= |c_#valid| (store |v_#valid_135| c_append_~node~0.base 1)))) (= |c_append_#in~head.base| c_append_~head.base) (<= 1 (select |c_#length| c_append_~node~0.base)) (<= (+ c_append_~node~0.base 1) |c_#StackHeapBarrier|) (= c_append_~node~0.offset 0) (not (= (select |c_#valid| c_append_~head.base) 1)) (= (select |c_#valid| c_append_~node~0.base) 1) (not (= c_append_~node~0.base 0)) (= |c_append_#in~head.offset| 0)) is different from false [2023-12-02 13:19:23,560 WARN L293 SmtUtils]: Spent 36.08s on a formula simplification. DAG size of input: 339 DAG size of output: 329 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:20:35,066 WARN L293 SmtUtils]: Spent 59.72s on a formula simplification. DAG size of input: 362 DAG size of output: 352 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:22:33,414 WARN L293 SmtUtils]: Spent 1.59m on a formula simplification. DAG size of input: 385 DAG size of output: 371 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:22:35,433 WARN L854 $PredicateComparison]: unable to prove that (and (<= |c_append_#in~input| 127) (= |c_append_#in~input| c_append_~input) (= |c_append_#t~mem4.base| (select (select |c_#memory_$Pointer$.base| c_append_~head.base) 0)) (= c_append_~head.offset 0) (<= 0 (+ 128 |c_append_#in~input|)) (<= 1 |c_#StackHeapBarrier|) (exists ((|v_#valid_135| (Array Int Int)) (|v_#memory_$Pointer$.base_114| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int))) (|v_#length_110| (Array Int Int)) (|v_#memory_$Pointer$.offset_114| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_91| c_append_~node~0.base (store (select |v_#memory_int_91| c_append_~node~0.base) 0 c_append_~input)) |c_#memory_int|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_114| c_append_~node~0.base (store (select |v_#memory_$Pointer$.base_114| c_append_~node~0.base) 0 (select (select |c_#memory_$Pointer$.base| c_append_~node~0.base) 0)))) (let ((.cse0 (= |c_old(#length)| |v_#length_110|)) (.cse1 (= |v_#memory_$Pointer$.base_114| |c_old(#memory_$Pointer$.base)|)) (.cse34 (= |c_old(#memory_int)| |v_#memory_int_91|)) (.cse8 (not (= |c_append_#in~head.base| 0))) (.cse35 (= |v_#valid_135| |c_old(#valid)|)) (.cse12 (<= (+ |c_append_#in~head.base| 1) |c_#StackHeapBarrier|)) (.cse36 (= |v_#memory_$Pointer$.offset_114| |c_old(#memory_$Pointer$.offset)|))) (or (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_10| (Array Int Int)) (|v_ULTIMATE.start_main_~userInput~1#1_18| Int) (|v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_main_~userInput~1#1_18|)) (<= |v_ULTIMATE.start_main_~userInput~1#1_18| 127) (let ((.cse2 (= (select |c_old(#valid)| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 1)) (.cse6 (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_10| 2) 1)) (.cse7 (= (select (store |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_10| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| 1) |c_append_#in~head.base|) 0)) (.cse9 (<= (+ |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| 1) |c_#StackHeapBarrier|)) (.cse10 (not (= |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| 0))) (.cse11 (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_10| 1) 1)) (.cse13 (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_10| 0) 0)) (.cse14 (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_10| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 0)) (.cse15 (exists ((|v_#length_107| (Array Int Int))) (and (= (select |v_#length_107| 2) 18) (= 2 (select |v_#length_107| 1))))) (.cse23 (<= 8 (select |c_old(#length)| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)))) (or (and .cse2 (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_12| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_85| |c_append_#in~head.base|)) (.cse5 (select |v_#memory_int_83| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)) (.cse3 (select |v_#memory_int_82| 1))) (and (= 48 (select .cse3 0)) (= (store |v_#memory_int_84| |c_append_#in~head.base| (store (select |v_#memory_int_84| |c_append_#in~head.base|) 0 (select .cse4 0))) |v_#memory_int_85|) (= |v_#memory_int_83| (store |v_#memory_int_82| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (select |v_#memory_int_82| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 0 (select .cse5 0)))) (= |v_old(#memory_int)_AFTER_CALL_12| (store |v_#memory_int_85| |c_append_#in~head.base| (store .cse4 4 (select (select |v_old(#memory_int)_AFTER_CALL_12| |c_append_#in~head.base|) 4)))) (= |v_#memory_int_84| (store |v_#memory_int_83| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store .cse5 4 (select (select |v_#memory_int_84| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 4)))) (= (select .cse3 1) 0)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_109| (Array Int (Array Int Int))) (|v_#memory_int_89| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_109| (Array Int (Array Int Int))) (|v_#valid_134| (Array Int Int)) (|v_#length_109| (Array Int Int)) (|v_#memory_$Pointer$.offset_110| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_110| (Array Int (Array Int Int))) (v_append_~node~0.base_BEFORE_RETURN_8 Int)) (let ((.cse16 (select |v_#memory_int_90| v_append_~node~0.base_BEFORE_RETURN_8)) (.cse20 (select |v_#memory_int_88| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)) (.cse18 (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)) (.cse17 (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|))) (and (= |c_old(#memory_int)| (store |v_#memory_int_90| v_append_~node~0.base_BEFORE_RETURN_8 (store .cse16 5 (select (select |c_old(#memory_int)| v_append_~node~0.base_BEFORE_RETURN_8) 5)))) (= (select .cse17 4) 0) (= (select .cse18 4) 0) (= (store |v_#memory_$Pointer$.base_109| v_append_~node~0.base_BEFORE_RETURN_8 (store (select |v_#memory_$Pointer$.base_109| v_append_~node~0.base_BEFORE_RETURN_8) 0 (select (select |v_#memory_$Pointer$.base_110| v_append_~node~0.base_BEFORE_RETURN_8) 0))) |v_#memory_$Pointer$.base_110|) (not (= v_append_~node~0.base_BEFORE_RETURN_8 0)) (= (select .cse17 0) 0) (<= (+ v_append_~node~0.base_BEFORE_RETURN_8 1) |c_#StackHeapBarrier|) (= (select |v_#valid_134| v_append_~node~0.base_BEFORE_RETURN_8) 0) (= (store |v_#valid_134| v_append_~node~0.base_BEFORE_RETURN_8 1) |c_old(#valid)|) (= (let ((.cse19 (store |v_#memory_int_86| v_append_~node~0.base_BEFORE_RETURN_8 (store (select |v_#memory_int_86| v_append_~node~0.base_BEFORE_RETURN_8) 0 |v_ULTIMATE.start_main_~userInput~1#1_18|)))) (store .cse19 |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (select .cse19 |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 0 (select .cse20 0)))) |v_#memory_int_88|) (= (store |v_#length_109| v_append_~node~0.base_BEFORE_RETURN_8 9) |c_old(#length)|) (= |v_#memory_int_90| (store |v_#memory_int_89| v_append_~node~0.base_BEFORE_RETURN_8 (store (select |v_#memory_int_89| v_append_~node~0.base_BEFORE_RETURN_8) 1 (select .cse16 1)))) (= |v_#memory_int_89| (store |v_#memory_int_88| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store .cse20 4 (select (select |v_#memory_int_89| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 4)))) (= (let ((.cse21 (store |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (store .cse18 0 v_append_~node~0.base_BEFORE_RETURN_8) 4 v_append_~node~0.base_BEFORE_RETURN_8)))) (store .cse21 v_append_~node~0.base_BEFORE_RETURN_8 (store (store (select .cse21 v_append_~node~0.base_BEFORE_RETURN_8) 1 0) 5 0))) |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| v_append_~node~0.base_BEFORE_RETURN_8) 1) (= (select .cse18 0) 0) (<= 9 (select |c_old(#length)| v_append_~node~0.base_BEFORE_RETURN_8)) (= |v_#memory_$Pointer$.offset_110| (store |v_#memory_$Pointer$.offset_109| v_append_~node~0.base_BEFORE_RETURN_8 (store (select |v_#memory_$Pointer$.offset_109| v_append_~node~0.base_BEFORE_RETURN_8) 0 (select (select |v_#memory_$Pointer$.offset_110| v_append_~node~0.base_BEFORE_RETURN_8) 0)))) (= (let ((.cse22 (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (store .cse17 0 0) 4 0)))) (store .cse22 v_append_~node~0.base_BEFORE_RETURN_8 (store (store (select .cse22 v_append_~node~0.base_BEFORE_RETURN_8) 1 0) 5 0))) |c_old(#memory_$Pointer$.offset)|)))) .cse23) (and .cse2 (exists ((|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_int_88| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_109| (Array Int (Array Int Int))) (|v_#memory_int_89| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_109| (Array Int (Array Int Int))) (|v_#valid_134| (Array Int Int)) (|v_#length_109| (Array Int Int)) (|v_#memory_$Pointer$.offset_110| (Array Int (Array Int Int))) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_110| (Array Int (Array Int Int))) (v_append_~node~0.base_BEFORE_RETURN_7 Int)) (let ((.cse24 (select |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)) (.cse27 (select |v_#memory_int_90| v_append_~node~0.base_BEFORE_RETURN_7)) (.cse28 (select |v_#memory_int_88| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)) (.cse25 (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|))) (and (= (select .cse24 4) 0) (= (select .cse25 4) 0) (= (store |v_#length_109| v_append_~node~0.base_BEFORE_RETURN_7 9) |c_old(#length)|) (= (select .cse24 0) 0) (= (select |v_#valid_134| v_append_~node~0.base_BEFORE_RETURN_7) 0) (= (let ((.cse26 (store |v_#memory_$Pointer$.offset_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (store .cse24 0 0) 4 0)))) (store .cse26 v_append_~node~0.base_BEFORE_RETURN_7 (store (store (select .cse26 v_append_~node~0.base_BEFORE_RETURN_7) 1 0) 5 0))) |c_old(#memory_$Pointer$.offset)|) (= |c_old(#valid)| (store |v_#valid_134| v_append_~node~0.base_BEFORE_RETURN_7 1)) (= (select |c_old(#valid)| v_append_~node~0.base_BEFORE_RETURN_7) 1) (<= (+ v_append_~node~0.base_BEFORE_RETURN_7 1) |c_#StackHeapBarrier|) (= |v_#memory_int_90| (store |v_#memory_int_89| v_append_~node~0.base_BEFORE_RETURN_7 (store (select |v_#memory_int_89| v_append_~node~0.base_BEFORE_RETURN_7) 1 (select .cse27 1)))) (= (store |v_#memory_$Pointer$.offset_109| v_append_~node~0.base_BEFORE_RETURN_7 (store (select |v_#memory_$Pointer$.offset_109| v_append_~node~0.base_BEFORE_RETURN_7) 0 (select (select |v_#memory_$Pointer$.offset_110| v_append_~node~0.base_BEFORE_RETURN_7) 0))) |v_#memory_$Pointer$.offset_110|) (= (store |v_#memory_int_90| v_append_~node~0.base_BEFORE_RETURN_7 (store .cse27 5 (select (select |c_old(#memory_int)| v_append_~node~0.base_BEFORE_RETURN_7) 5))) |c_old(#memory_int)|) (= |v_#memory_int_89| (store |v_#memory_int_88| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store .cse28 4 (select (select |v_#memory_int_89| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 4)))) (not (= v_append_~node~0.base_BEFORE_RETURN_7 0)) (= (store |v_#memory_$Pointer$.base_109| v_append_~node~0.base_BEFORE_RETURN_7 (store (select |v_#memory_$Pointer$.base_109| v_append_~node~0.base_BEFORE_RETURN_7) 0 (select (select |v_#memory_$Pointer$.base_110| v_append_~node~0.base_BEFORE_RETURN_7) 0))) |v_#memory_$Pointer$.base_110|) (<= 9 (select |c_old(#length)| v_append_~node~0.base_BEFORE_RETURN_7)) (= (select .cse25 0) 0) (= |v_#memory_int_88| (let ((.cse29 (store |v_#memory_int_86| v_append_~node~0.base_BEFORE_RETURN_7 (store (select |v_#memory_int_86| v_append_~node~0.base_BEFORE_RETURN_7) 0 |v_ULTIMATE.start_main_~userInput~1#1_18|)))) (store .cse29 |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (select .cse29 |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 0 (select .cse28 0))))) (= (let ((.cse30 (store |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (store .cse25 0 v_append_~node~0.base_BEFORE_RETURN_7) 4 v_append_~node~0.base_BEFORE_RETURN_7)))) (store .cse30 v_append_~node~0.base_BEFORE_RETURN_7 (store (store (select .cse30 v_append_~node~0.base_BEFORE_RETURN_7) 1 0) 5 0))) |c_old(#memory_$Pointer$.base)|)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_11| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_int_85| |c_append_#in~head.base|)) (.cse33 (select |v_#memory_int_83| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|)) (.cse32 (select |v_#memory_int_82| 1))) (and (= |v_old(#memory_int)_AFTER_CALL_11| (store |v_#memory_int_85| |c_append_#in~head.base| (store .cse31 4 (select (select |v_old(#memory_int)_AFTER_CALL_11| |c_append_#in~head.base|) 4)))) (= 48 (select .cse32 0)) (= (store |v_#memory_int_84| |c_append_#in~head.base| (store (select |v_#memory_int_84| |c_append_#in~head.base|) 0 (select .cse31 0))) |v_#memory_int_85|) (= |v_#memory_int_83| (store |v_#memory_int_82| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store (select |v_#memory_int_82| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 0 (select .cse33 0)))) (= |v_#memory_int_84| (store |v_#memory_int_83| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12| (store .cse33 4 (select (select |v_#memory_int_84| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_12|) 4)))) (= (select .cse32 1) 0)))) .cse23))))) .cse34 .cse35 .cse36) (and .cse0 .cse1 (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#length_107| (Array Int Int)) (|v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| (Array Int Int)) (|v_#memory_$Pointer$.base_105| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (let ((.cse40 (select |v_#memory_int_85| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|)) (.cse41 (store |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| |c_append_#in~head.base| 1)) (.cse38 (select |v_#memory_int_82| 1)) (.cse37 (select |v_#memory_int_83| |c_append_#in~head.base|))) (and (= (select |v_#length_107| 2) 18) (= |v_#memory_int_83| (store |v_#memory_int_82| |c_append_#in~head.base| (store (select |v_#memory_int_82| |c_append_#in~head.base|) 0 (select .cse37 0)))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| |c_append_#in~head.base|) 0) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| 1) 1) (= 48 (select .cse38 0)) (= |c_old(#memory_$Pointer$.base)| (let ((.cse39 (store |v_#memory_$Pointer$.base_105| |c_append_#in~head.base| (store (store (select |v_#memory_$Pointer$.base_105| |c_append_#in~head.base|) 0 0) 4 0)))) (store .cse39 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| (store (store (select .cse39 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|) 0 0) 4 0)))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| 2) 1) (= |c_old(#length)| (store (store |v_#length_107| |c_append_#in~head.base| 8) |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| 8)) (= (store |v_#memory_int_84| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| (store (select |v_#memory_int_84| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|) 0 (select .cse40 0))) |v_#memory_int_85|) (= (store .cse41 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| 1) |c_old(#valid)|) (<= (+ |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| 1) |c_#StackHeapBarrier|) (= (store |v_#memory_int_85| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| (store .cse40 4 (select (select |c_old(#memory_int)| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|) 4))) |c_old(#memory_int)|) (= |c_old(#memory_$Pointer$.offset)| (let ((.cse42 (store |v_#memory_$Pointer$.offset_105| |c_append_#in~head.base| (store (store (select |v_#memory_$Pointer$.offset_105| |c_append_#in~head.base|) 0 0) 4 0)))) (store .cse42 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| (store (store (select .cse42 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|) 0 0) 4 0)))) (not (= |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13| 0)) (= (select .cse41 |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|) 0) (= (select .cse38 1) 0) (= 2 (select |v_#length_107| 1)) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_11| 0) 0) (= |v_#memory_int_84| (store |v_#memory_int_83| |c_append_#in~head.base| (store .cse37 4 (select (select |v_#memory_int_84| |c_append_#in~head.base|) 4)))) (<= 8 (select |c_old(#length)| |v_ULTIMATE.start_main_~list2~0#1.base_BEFORE_CALL_13|))))) .cse34 .cse8 .cse35 .cse12 .cse36))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_114| c_append_~node~0.base (store (select |v_#memory_$Pointer$.offset_114| c_append_~node~0.base) 0 (select (select |c_#memory_$Pointer$.offset| c_append_~node~0.base) 0)))) (= (select |v_#valid_135| c_append_~node~0.base) 0) (= (store |v_#length_110| c_append_~node~0.base 9) |c_#length|) (= |c_#valid| (store |v_#valid_135| c_append_~node~0.base 1)))) (= |c_append_#in~head.base| c_append_~head.base) (= (select |c_#valid| c_append_~head.base) 1) (<= 1 (select |c_#length| c_append_~node~0.base)) (<= (+ c_append_~node~0.base 1) |c_#StackHeapBarrier|) (= c_append_~node~0.offset 0) (= (select |c_#valid| c_append_~node~0.base) 1) (let ((.cse43 (= |c_append_#t~mem4.base| 0)) (.cse44 (= |c_append_#t~mem4.offset| 0))) (or (and .cse43 |c_append_#t~short6| .cse44) (and (or (not .cse43) (not .cse44)) (not |c_append_#t~short6|)))) (<= 4 (select |c_#length| c_append_~head.base)) (not (= c_append_~node~0.base 0)) (= |c_append_#in~head.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| c_append_~head.base) 0) |c_append_#t~mem4.offset|)) is different from false [2023-12-02 13:24:58,705 WARN L293 SmtUtils]: Spent 2.09m on a formula simplification. DAG size of input: 400 DAG size of output: 386 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:27:45,047 WARN L293 SmtUtils]: Spent 2.36m on a formula simplification. DAG size of input: 415 DAG size of output: 401 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:30:31,812 WARN L293 SmtUtils]: Spent 2.33m on a formula simplification. DAG size of input: 399 DAG size of output: 385 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)