./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:03:24,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:03:24,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:03:24,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:03:24,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:03:24,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:03:24,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:03:24,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:03:24,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:03:24,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:03:24,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:03:24,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:03:24,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:03:24,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:03:24,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:03:24,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:03:24,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:03:24,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:03:24,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:03:24,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:03:24,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:03:24,356 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:03:24,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:03:24,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:03:24,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:03:24,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:03:24,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:03:24,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:03:24,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:03:24,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:03:24,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:03:24,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:03:24,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:03:24,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:03:24,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:03:24,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:03:24,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:03:24,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:03:24,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:03:24,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:03:24,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:03:24,395 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-25 18:03:24,455 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:03:24,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:03:24,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:03:24,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:03:24,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:03:24,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:03:24,460 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:03:24,460 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:03:24,460 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:03:24,460 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:03:24,462 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:03:24,462 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:03:24,462 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:03:24,463 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:03:24,463 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:03:24,463 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:03:24,463 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:03:24,464 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:03:24,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-25 18:03:24,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-25 18:03:24,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:03:24,466 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:03:24,466 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-25 18:03:24,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:03:24,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:03:24,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:03:24,469 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-25 18:03:24,469 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-25 18:03:24,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:03:24,470 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-25 18:03:24,470 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:03:24,470 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:03:24,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:03:24,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:03:24,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:03:24,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:03:24,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:03:24,472 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:03:24,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:03:24,473 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:03:24,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:03:24,473 INFO L138 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_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/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_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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-memcleanup) ) 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 -> 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 [2021-11-25 18:03:24,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:03:24,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:03:24,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:03:24,889 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:03:24,890 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:03:24,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2021-11-25 18:03:24,976 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/data/1f716aa95/6e707ef971d74a63a6b9fd1b4d581d6a/FLAG317bf8fdb [2021-11-25 18:03:25,703 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:03:25,703 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2021-11-25 18:03:25,742 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/data/1f716aa95/6e707ef971d74a63a6b9fd1b4d581d6a/FLAG317bf8fdb [2021-11-25 18:03:25,912 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/data/1f716aa95/6e707ef971d74a63a6b9fd1b4d581d6a [2021-11-25 18:03:25,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:03:25,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:03:25,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:03:25,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:03:25,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:03:25,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:03:25" (1/1) ... [2021-11-25 18:03:25,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b53d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:25, skipping insertion in model container [2021-11-25 18:03:25,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:03:25" (1/1) ... [2021-11-25 18:03:25,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:03:26,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:03:26,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2021-11-25 18:03:26,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:03:26,447 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:03:26,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2021-11-25 18:03:26,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:03:26,565 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:03:26,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:26 WrapperNode [2021-11-25 18:03:26,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:03:26,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:03:26,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:03:26,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:03:26,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:26" (1/1) ... [2021-11-25 18:03:26,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:26" (1/1) ... [2021-11-25 18:03:26,632 INFO L137 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2021-11-25 18:03:26,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:03:26,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:03:26,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:03:26,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:03:26,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:26" (1/1) ... [2021-11-25 18:03:26,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:26" (1/1) ... [2021-11-25 18:03:26,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:26" (1/1) ... [2021-11-25 18:03:26,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:26" (1/1) ... [2021-11-25 18:03:26,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:26" (1/1) ... [2021-11-25 18:03:26,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:26" (1/1) ... [2021-11-25 18:03:26,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:26" (1/1) ... [2021-11-25 18:03:26,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:03:26,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:03:26,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:03:26,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:03:26,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:26" (1/1) ... [2021-11-25 18:03:26,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:03:26,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:03:26,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:03:26,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:03:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-11-25 18:03:26,823 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-11-25 18:03:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 18:03:26,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:03:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 18:03:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-25 18:03:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2021-11-25 18:03:26,824 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2021-11-25 18:03:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-25 18:03:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 18:03:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-25 18:03:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 18:03:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:03:26,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:03:27,049 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:03:27,056 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:03:27,117 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-11-25 18:03:27,674 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:03:27,785 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:03:27,785 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-25 18:03:27,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:03:27 BoogieIcfgContainer [2021-11-25 18:03:27,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:03:27,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:03:27,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:03:27,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:03:27,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:03:25" (1/3) ... [2021-11-25 18:03:27,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b670cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:03:27, skipping insertion in model container [2021-11-25 18:03:27,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:03:26" (2/3) ... [2021-11-25 18:03:27,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b670cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:03:27, skipping insertion in model container [2021-11-25 18:03:27,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:03:27" (3/3) ... [2021-11-25 18:03:27,804 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2021-11-25 18:03:27,811 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:03:27,811 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2021-11-25 18:03:27,883 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:03:27,895 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 18:03:27,896 INFO L340 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2021-11-25 18:03:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 51 states have (on average 2.176470588235294) internal successors, (111), 94 states have internal predecessors, (111), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-25 18:03:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-25 18:03:27,940 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:27,941 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:27,942 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:27,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash -303362409, now seen corresponding path program 1 times [2021-11-25 18:03:27,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:27,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038903482] [2021-11-25 18:03:27,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:27,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:28,236 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:28,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038903482] [2021-11-25 18:03:28,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038903482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:28,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:28,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:03:28,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80798463] [2021-11-25 18:03:28,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:28,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:03:28,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:28,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:03:28,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:03:28,289 INFO L87 Difference]: Start difference. First operand has 99 states, 51 states have (on average 2.176470588235294) internal successors, (111), 94 states have internal predecessors, (111), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:28,450 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2021-11-25 18:03:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:03:28,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-25 18:03:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:28,463 INFO L225 Difference]: With dead ends: 105 [2021-11-25 18:03:28,464 INFO L226 Difference]: Without dead ends: 100 [2021-11-25 18:03:28,466 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:03:28,471 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:28,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 170 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:03:28,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-25 18:03:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2021-11-25 18:03:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 50 states have (on average 2.08) internal successors, (104), 91 states have internal predecessors, (104), 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) [2021-11-25 18:03:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2021-11-25 18:03:28,528 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 8 [2021-11-25 18:03:28,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:28,528 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2021-11-25 18:03:28,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2021-11-25 18:03:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 18:03:28,530 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:28,530 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:28,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 18:03:28,531 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:28,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:28,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1366900647, now seen corresponding path program 1 times [2021-11-25 18:03:28,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:28,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763912859] [2021-11-25 18:03:28,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:28,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:28,637 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:28,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763912859] [2021-11-25 18:03:28,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763912859] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:28,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:28,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 18:03:28,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866160478] [2021-11-25 18:03:28,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:28,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:03:28,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:28,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:03:28,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:03:28,643 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 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) [2021-11-25 18:03:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:28,848 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2021-11-25 18:03:28,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 18:03:28,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 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 [2021-11-25 18:03:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:28,852 INFO L225 Difference]: With dead ends: 141 [2021-11-25 18:03:28,852 INFO L226 Difference]: Without dead ends: 141 [2021-11-25 18:03:28,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:03:28,855 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 88 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:28,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 470 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:03:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-25 18:03:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2021-11-25 18:03:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 112 states have internal predecessors, (147), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-25 18:03:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2021-11-25 18:03:28,875 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 10 [2021-11-25 18:03:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:28,875 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2021-11-25 18:03:28,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 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) [2021-11-25 18:03:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2021-11-25 18:03:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-25 18:03:28,877 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:28,877 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:28,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 18:03:28,878 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting sll_appendErr1REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:28,879 INFO L85 PathProgramCache]: Analyzing trace with hash 575489218, now seen corresponding path program 1 times [2021-11-25 18:03:28,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:28,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853963163] [2021-11-25 18:03:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:28,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:28,984 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:28,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853963163] [2021-11-25 18:03:28,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853963163] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:28,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:28,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:03:28,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725039409] [2021-11-25 18:03:28,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:28,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:03:28,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:28,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:03:28,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:03:28,990 INFO L87 Difference]: Start difference. First operand 118 states and 153 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2021-11-25 18:03:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:29,190 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2021-11-25 18:03:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:03:29,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2021-11-25 18:03:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:29,197 INFO L225 Difference]: With dead ends: 146 [2021-11-25 18:03:29,202 INFO L226 Difference]: Without dead ends: 146 [2021-11-25 18:03:29,203 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:03:29,204 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 32 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:29,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 154 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:03:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-25 18:03:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 117. [2021-11-25 18:03:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 2.0422535211267605) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-25 18:03:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2021-11-25 18:03:29,237 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 11 [2021-11-25 18:03:29,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:29,237 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2021-11-25 18:03:29,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2021-11-25 18:03:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2021-11-25 18:03:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-25 18:03:29,239 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:29,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:29,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 18:03:29,239 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting sll_appendErr0REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:29,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:29,240 INFO L85 PathProgramCache]: Analyzing trace with hash 575489217, now seen corresponding path program 1 times [2021-11-25 18:03:29,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:29,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421849628] [2021-11-25 18:03:29,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:29,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:29,294 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:29,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421849628] [2021-11-25 18:03:29,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421849628] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:29,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:29,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:03:29,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610548339] [2021-11-25 18:03:29,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:29,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:03:29,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:29,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:03:29,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:03:29,297 INFO L87 Difference]: Start difference. First operand 117 states and 151 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2021-11-25 18:03:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:29,449 INFO L93 Difference]: Finished difference Result 145 states and 182 transitions. [2021-11-25 18:03:29,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:03:29,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2021-11-25 18:03:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:29,452 INFO L225 Difference]: With dead ends: 145 [2021-11-25 18:03:29,452 INFO L226 Difference]: Without dead ends: 145 [2021-11-25 18:03:29,452 INFO L932 BasicCegarLoop]: 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 [2021-11-25 18:03:29,466 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 31 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:29,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 149 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:03:29,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-11-25 18:03:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2021-11-25 18:03:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 2.0140845070422535) internal successors, (143), 110 states have internal predecessors, (143), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-25 18:03:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 149 transitions. [2021-11-25 18:03:29,492 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 149 transitions. Word has length 11 [2021-11-25 18:03:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:29,492 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 149 transitions. [2021-11-25 18:03:29,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2021-11-25 18:03:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 149 transitions. [2021-11-25 18:03:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-25 18:03:29,494 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:29,494 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:29,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 18:03:29,497 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:29,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1631077593, now seen corresponding path program 1 times [2021-11-25 18:03:29,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:29,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198039617] [2021-11-25 18:03:29,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:29,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:29,646 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:29,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198039617] [2021-11-25 18:03:29,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198039617] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:03:29,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17119057] [2021-11-25 18:03:29,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:29,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:03:29,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:03:29,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:03:29,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 18:03:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:29,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-25 18:03:29,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:03:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:29,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:03:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:29,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17119057] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:03:29,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1602496339] [2021-11-25 18:03:30,041 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-11-25 18:03:30,041 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:03:30,047 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:03:30,053 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:03:30,060 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:03:30,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:30,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:30,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:03:31,080 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 38 for LOIs [2021-11-25 18:03:31,136 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:03:31,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1602496339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:31,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:03:31,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 3, 3] total 17 [2021-11-25 18:03:31,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160537136] [2021-11-25 18:03:31,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:31,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 18:03:31,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:31,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 18:03:31,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:03:31,765 INFO L87 Difference]: Start difference. First operand 116 states and 149 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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) [2021-11-25 18:03:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:32,361 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2021-11-25 18:03:32,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:03:32,362 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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 12 [2021-11-25 18:03:32,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:32,363 INFO L225 Difference]: With dead ends: 131 [2021-11-25 18:03:32,364 INFO L226 Difference]: Without dead ends: 131 [2021-11-25 18:03:32,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:03:32,366 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 64 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:32,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 263 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-25 18:03:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-25 18:03:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2021-11-25 18:03:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 75 states have (on average 1.96) internal successors, (147), 113 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-25 18:03:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 153 transitions. [2021-11-25 18:03:32,379 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 153 transitions. Word has length 12 [2021-11-25 18:03:32,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:32,379 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 153 transitions. [2021-11-25 18:03:32,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 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) [2021-11-25 18:03:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2021-11-25 18:03:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 18:03:32,381 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:32,381 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:32,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:03:32,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:03:32,608 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:32,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1005403790, now seen corresponding path program 1 times [2021-11-25 18:03:32,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:32,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653153335] [2021-11-25 18:03:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:32,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:32,752 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653153335] [2021-11-25 18:03:32,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653153335] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:03:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642546769] [2021-11-25 18:03:32,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:32,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:03:32,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:03:32,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:03:32,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 18:03:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:32,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-25 18:03:32,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:03:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:32,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:03:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:03:33,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642546769] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:03:33,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [336218817] [2021-11-25 18:03:33,029 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-25 18:03:33,030 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:03:33,030 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:03:33,030 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:03:33,031 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:03:33,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:33,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:33,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:03:33,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:33,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:33,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2021-11-25 18:03:33,221 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2021-11-25 18:03:34,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:34,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:03:34,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:34,813 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:03:34,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:03:34,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:03:34,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:03:34,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:34,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:35,033 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:03:37,458 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1523#(and (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (not (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1)) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_#res#1.offset| |sll_append_node_create_with_sublist_#t~ret6#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_node_create_with_sublist_#t~ret6#1.base|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (<= |sll_append_~head#1.offset| 0) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:03:37,459 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:03:37,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:03:37,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-11-25 18:03:37,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421541899] [2021-11-25 18:03:37,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:03:37,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:03:37,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:37,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:03:37,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2021-11-25 18:03:37,462 INFO L87 Difference]: Start difference. First operand 120 states and 153 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:37,901 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2021-11-25 18:03:37,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:03:37,902 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-25 18:03:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:37,904 INFO L225 Difference]: With dead ends: 212 [2021-11-25 18:03:37,905 INFO L226 Difference]: Without dead ends: 212 [2021-11-25 18:03:37,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:03:37,906 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 220 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:37,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 974 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 18:03:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-11-25 18:03:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 119. [2021-11-25 18:03:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 75 states have (on average 1.9466666666666668) internal successors, (146), 114 states have internal predecessors, (146), 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) [2021-11-25 18:03:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2021-11-25 18:03:37,918 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 13 [2021-11-25 18:03:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:37,918 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2021-11-25 18:03:37,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2021-11-25 18:03:37,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:03:37,920 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:37,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:37,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 18:03:38,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-25 18:03:38,136 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:38,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1574251492, now seen corresponding path program 1 times [2021-11-25 18:03:38,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:38,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852220649] [2021-11-25 18:03:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:38,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:03:38,242 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:38,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852220649] [2021-11-25 18:03:38,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852220649] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:03:38,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329920420] [2021-11-25 18:03:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:38,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:03:38,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:03:38,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:03:38,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 18:03:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:38,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-25 18:03:38,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:03:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:03:38,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:03:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:03:38,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329920420] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:03:38,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [155078464] [2021-11-25 18:03:38,449 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2021-11-25 18:03:38,449 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:03:38,450 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:03:38,450 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:03:38,450 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:03:38,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:38,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:38,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:03:38,817 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 38 for LOIs [2021-11-25 18:03:39,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:39,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:39,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:03:39,780 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:03:39,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:03:39,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-25 18:03:39,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:39,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:39,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:03:39,946 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:03:41,299 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1963#(and (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (not (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1)) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_#res#1.offset| |sll_append_node_create_with_sublist_#t~ret6#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_node_create_with_sublist_#t~ret6#1.base|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (<= |sll_append_~head#1.offset| 0) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:03:41,300 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:03:41,300 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:03:41,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2021-11-25 18:03:41,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12790160] [2021-11-25 18:03:41,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:03:41,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:03:41,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:41,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:03:41,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:03:41,302 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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) [2021-11-25 18:03:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:41,432 INFO L93 Difference]: Finished difference Result 165 states and 201 transitions. [2021-11-25 18:03:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 18:03:41,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 15 [2021-11-25 18:03:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:41,434 INFO L225 Difference]: With dead ends: 165 [2021-11-25 18:03:41,434 INFO L226 Difference]: Without dead ends: 165 [2021-11-25 18:03:41,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:03:41,435 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 74 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:41,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 263 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:03:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-25 18:03:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2021-11-25 18:03:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 88 states have (on average 1.8409090909090908) internal successors, (162), 127 states have internal predecessors, (162), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-25 18:03:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions. [2021-11-25 18:03:41,456 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 15 [2021-11-25 18:03:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:41,457 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions. [2021-11-25 18:03:41,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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) [2021-11-25 18:03:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2021-11-25 18:03:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 18:03:41,462 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:41,462 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:41,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 18:03:41,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:03:41,688 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting sll_appendErr2REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:41,689 INFO L85 PathProgramCache]: Analyzing trace with hash 13207570, now seen corresponding path program 2 times [2021-11-25 18:03:41,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:41,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823191231] [2021-11-25 18:03:41,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:41,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:03:41,869 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:41,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823191231] [2021-11-25 18:03:41,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823191231] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:03:41,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621594994] [2021-11-25 18:03:41,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:03:41,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:03:41,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:03:41,884 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:03:41,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 18:03:42,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:03:42,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:03:42,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 18:03:42,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:03:42,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:03:42,062 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:03:42,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:03:42,095 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:03:42,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:03:42,131 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:03:42,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 [2021-11-25 18:03:42,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-25 18:03:42,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:03:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:03:42,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621594994] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:03:42,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2009778306] [2021-11-25 18:03:42,372 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-25 18:03:42,373 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:03:42,373 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:03:42,373 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:03:42,374 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:03:42,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:42,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:42,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:03:42,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:42,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:42,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2021-11-25 18:03:42,509 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2021-11-25 18:03:43,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:43,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:43,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:03:43,706 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:03:43,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-11-25 18:03:43,748 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:03:43,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:03:43,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:43,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:43,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:03:43,941 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:03:45,725 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2388#(and (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (not (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1)) (<= |sll_append_#in~sublist_length#1| 3) (<= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= |sll_append_#in~head#1.offset| 0) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (<= 0 |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_node_create_with_sublist_#t~ret6#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_node_create_with_sublist_#t~ret6#1.base|) (<= 3 |sll_append_#in~sublist_length#1|) (<= 0 |sll_append_#in~head#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (<= |sll_append_~head#1.offset| 0) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (<= 0 |#StackHeapBarrier|) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:03:45,725 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:03:45,725 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:03:45,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-11-25 18:03:45,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454408023] [2021-11-25 18:03:45,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:03:45,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 18:03:45,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:45,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 18:03:45,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:03:45,727 INFO L87 Difference]: Start difference. First operand 134 states and 170 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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) [2021-11-25 18:03:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:45,813 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2021-11-25 18:03:45,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:03:45,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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 19 [2021-11-25 18:03:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:45,816 INFO L225 Difference]: With dead ends: 132 [2021-11-25 18:03:45,816 INFO L226 Difference]: Without dead ends: 132 [2021-11-25 18:03:45,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-11-25 18:03:45,818 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 88 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:45,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 180 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2021-11-25 18:03:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-25 18:03:45,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-11-25 18:03:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.7954545454545454) internal successors, (158), 125 states have internal predecessors, (158), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-25 18:03:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2021-11-25 18:03:45,826 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 19 [2021-11-25 18:03:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:45,827 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2021-11-25 18:03:45,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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) [2021-11-25 18:03:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2021-11-25 18:03:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 18:03:45,833 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:45,834 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:45,879 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 18:03:46,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:03:46,044 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting sll_appendErr3REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:46,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash 13207571, now seen corresponding path program 1 times [2021-11-25 18:03:46,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:46,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488912578] [2021-11-25 18:03:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:46,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:03:46,244 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:46,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488912578] [2021-11-25 18:03:46,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488912578] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:03:46,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032665156] [2021-11-25 18:03:46,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:46,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:03:46,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:03:46,248 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:03:46,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 18:03:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:46,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-25 18:03:46,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:03:46,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:03:46,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:03:46,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:46,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2021-11-25 18:03:46,486 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:03:46,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:03:46,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:46,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2021-11-25 18:03:46,552 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:03:46,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:03:46,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:46,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-25 18:03:46,669 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-25 18:03:46,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 18:03:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:03:46,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:03:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:03:47,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032665156] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:03:47,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1341323202] [2021-11-25 18:03:47,777 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-25 18:03:47,777 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:03:47,777 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:03:47,778 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:03:47,778 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:03:47,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:47,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:47,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:03:47,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:47,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:47,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2021-11-25 18:03:47,887 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2021-11-25 18:03:48,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:03:48,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:48,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:49,005 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:03:49,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:03:49,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-25 18:03:49,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:49,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:03:49,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:49,184 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:03:51,404 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2781#(and (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (< (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8)) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_#res#1.offset| |sll_append_node_create_with_sublist_#t~ret6#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_node_create_with_sublist_#t~ret6#1.base|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (<= |sll_append_~head#1.offset| 0) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:03:51,404 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:03:51,404 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:03:51,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2021-11-25 18:03:51,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339136914] [2021-11-25 18:03:51,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:03:51,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:03:51,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:51,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:03:51,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-11-25 18:03:51,406 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 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) [2021-11-25 18:03:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:51,607 INFO L93 Difference]: Finished difference Result 130 states and 162 transitions. [2021-11-25 18:03:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 18:03:51,608 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 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 19 [2021-11-25 18:03:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:51,609 INFO L225 Difference]: With dead ends: 130 [2021-11-25 18:03:51,610 INFO L226 Difference]: Without dead ends: 130 [2021-11-25 18:03:51,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2021-11-25 18:03:51,611 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 83 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:51,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 156 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 65 Unchecked, 0.1s Time] [2021-11-25 18:03:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-25 18:03:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-11-25 18:03:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 88 states have (on average 1.75) internal successors, (154), 123 states have internal predecessors, (154), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-25 18:03:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2021-11-25 18:03:51,618 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 19 [2021-11-25 18:03:51,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:51,619 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2021-11-25 18:03:51,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 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) [2021-11-25 18:03:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2021-11-25 18:03:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:03:51,620 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:51,621 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:51,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 18:03:51,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:03:51,840 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting sll_appendErr6REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:51,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash -192183934, now seen corresponding path program 1 times [2021-11-25 18:03:51,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:51,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677118033] [2021-11-25 18:03:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:51,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-25 18:03:51,943 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:51,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677118033] [2021-11-25 18:03:51,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677118033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:51,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:51,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 18:03:51,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312800452] [2021-11-25 18:03:51,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:51,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 18:03:51,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:51,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 18:03:51,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 18:03:51,947 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2021-11-25 18:03:52,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:52,062 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2021-11-25 18:03:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:03:52,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 21 [2021-11-25 18:03:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:52,065 INFO L225 Difference]: With dead ends: 129 [2021-11-25 18:03:52,065 INFO L226 Difference]: Without dead ends: 129 [2021-11-25 18:03:52,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:03:52,066 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 50 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:52,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 144 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:03:52,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-11-25 18:03:52,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-11-25 18:03:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 88 states have (on average 1.7272727272727273) internal successors, (152), 122 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-25 18:03:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2021-11-25 18:03:52,078 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 21 [2021-11-25 18:03:52,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:52,082 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2021-11-25 18:03:52,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2021-11-25 18:03:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2021-11-25 18:03:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:03:52,086 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:52,086 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:52,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 18:03:52,087 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting sll_appendErr7REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:52,087 INFO L85 PathProgramCache]: Analyzing trace with hash -192183933, now seen corresponding path program 1 times [2021-11-25 18:03:52,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:52,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662160291] [2021-11-25 18:03:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:52,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-25 18:03:52,196 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:52,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662160291] [2021-11-25 18:03:52,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662160291] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:03:52,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:03:52,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 18:03:52,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949880513] [2021-11-25 18:03:52,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:03:52,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:03:52,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:52,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:03:52,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 18:03:52,199 INFO L87 Difference]: Start difference. First operand 129 states and 160 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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) [2021-11-25 18:03:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:52,305 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2021-11-25 18:03:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:03:52,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 21 [2021-11-25 18:03:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:52,308 INFO L225 Difference]: With dead ends: 128 [2021-11-25 18:03:52,308 INFO L226 Difference]: Without dead ends: 128 [2021-11-25 18:03:52,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:03:52,309 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 71 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:52,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 164 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:03:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-11-25 18:03:52,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2021-11-25 18:03:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 121 states have internal predecessors, (150), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-25 18:03:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2021-11-25 18:03:52,315 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 21 [2021-11-25 18:03:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:52,315 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2021-11-25 18:03:52,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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) [2021-11-25 18:03:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2021-11-25 18:03:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 18:03:52,317 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:52,317 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:52,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 18:03:52,317 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting sll_appendErr8REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:52,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1662734635, now seen corresponding path program 1 times [2021-11-25 18:03:52,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:52,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674314627] [2021-11-25 18:03:52,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:52,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:03:52,513 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:52,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674314627] [2021-11-25 18:03:52,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674314627] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:03:52,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613604502] [2021-11-25 18:03:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:52,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:03:52,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:03:52,516 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:03:52,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 18:03:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:52,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-25 18:03:52,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:03:52,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:03:52,720 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:03:52,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 [2021-11-25 18:03:52,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:52,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 [2021-11-25 18:03:52,815 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:03:52,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-11-25 18:03:52,912 INFO L354 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2021-11-25 18:03:52,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 21 treesize of output 38 [2021-11-25 18:03:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:03:53,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:03:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:03:53,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613604502] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:03:53,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1741664987] [2021-11-25 18:03:53,472 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-25 18:03:53,472 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:03:53,473 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:03:53,473 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:03:53,473 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:03:53,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:53,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:53,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:03:53,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:53,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:53,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2021-11-25 18:03:53,587 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2021-11-25 18:03:54,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:54,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:03:54,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:54,630 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:03:54,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-11-25 18:03:54,666 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:03:54,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:03:54,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:03:54,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:54,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:03:54,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:03:54,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-25 18:03:55,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:55,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:03:55,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:03:55,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:55,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:03:55,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:55,384 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-25 18:03:55,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-11-25 18:03:55,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:03:55,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:55,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-25 18:03:55,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:55,719 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-25 18:03:55,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 18:03:55,866 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:03:58,951 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3723#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (not (= (select |#valid| |sll_append_~head#1.base|) 1)) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_~new_head~0#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:03:58,951 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:03:58,951 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:03:58,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-25 18:03:58,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626627972] [2021-11-25 18:03:58,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:03:58,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 18:03:58,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:03:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 18:03:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:03:58,954 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:59,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:03:59,270 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2021-11-25 18:03:59,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:03:59,271 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-25 18:03:59,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:03:59,272 INFO L225 Difference]: With dead ends: 147 [2021-11-25 18:03:59,272 INFO L226 Difference]: Without dead ends: 147 [2021-11-25 18:03:59,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2021-11-25 18:03:59,274 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 191 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:03:59,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 212 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 95 Unchecked, 0.2s Time] [2021-11-25 18:03:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-11-25 18:03:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2021-11-25 18:03:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 88 states have (on average 1.6363636363636365) internal successors, (144), 117 states have internal predecessors, (144), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-25 18:03:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2021-11-25 18:03:59,281 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 22 [2021-11-25 18:03:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:03:59,281 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2021-11-25 18:03:59,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:03:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2021-11-25 18:03:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 18:03:59,283 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:03:59,283 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:03:59,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 18:03:59,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-25 18:03:59,509 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting sll_appendErr9REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:03:59,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:03:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1662734634, now seen corresponding path program 1 times [2021-11-25 18:03:59,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:03:59,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165962264] [2021-11-25 18:03:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:59,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:03:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:03:59,729 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:03:59,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165962264] [2021-11-25 18:03:59,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165962264] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:03:59,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383288785] [2021-11-25 18:03:59,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:03:59,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:03:59,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:03:59,732 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:03:59,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 18:03:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:03:59,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-25 18:03:59,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:03:59,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:03:59,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:03:59,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2021-11-25 18:04:00,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:00,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2021-11-25 18:04:00,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:00,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2021-11-25 18:04:00,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:00,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2021-11-25 18:04:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:04:00,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:04:01,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383288785] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:01,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [897874129] [2021-11-25 18:04:01,574 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-25 18:04:01,574 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:01,575 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:01,575 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:01,575 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:01,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:01,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:01,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:04:01,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:01,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:01,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2021-11-25 18:04:01,691 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2021-11-25 18:04:02,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:02,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:02,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:02,788 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:04:02,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-11-25 18:04:02,819 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:04:02,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:04:02,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:02,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:02,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:03,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-25 18:04:03,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:04:03,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:03,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:04:03,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:03,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:03,373 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-25 18:04:03,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-11-25 18:04:03,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:03,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:04:03,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:03,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:03,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-25 18:04:03,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:03,757 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-25 18:04:03,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 18:04:03,908 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:06,993 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4152#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (< (select |#length| |sll_append_~head#1.base|) (+ |sll_append_~head#1.offset| 4)) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:06,993 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:06,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:06,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2021-11-25 18:04:06,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130944612] [2021-11-25 18:04:06,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:06,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:04:06,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:04:06,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2021-11-25 18:04:06,996 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:07,300 INFO L93 Difference]: Finished difference Result 143 states and 171 transitions. [2021-11-25 18:04:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:04:07,301 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-25 18:04:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:07,302 INFO L225 Difference]: With dead ends: 143 [2021-11-25 18:04:07,303 INFO L226 Difference]: Without dead ends: 143 [2021-11-25 18:04:07,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:04:07,306 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 125 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:07,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 194 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 225 Invalid, 0 Unknown, 112 Unchecked, 0.3s Time] [2021-11-25 18:04:07,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-25 18:04:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 120. [2021-11-25 18:04:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 88 states have (on average 1.5681818181818181) internal successors, (138), 113 states have internal predecessors, (138), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-25 18:04:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2021-11-25 18:04:07,318 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 22 [2021-11-25 18:04:07,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:07,321 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2021-11-25 18:04:07,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2021-11-25 18:04:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 18:04:07,322 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:07,322 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:04:07,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-25 18:04:07,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:07,542 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:04:07,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:07,542 INFO L85 PathProgramCache]: Analyzing trace with hash -159940653, now seen corresponding path program 1 times [2021-11-25 18:04:07,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:07,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899885303] [2021-11-25 18:04:07,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:07,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:04:07,896 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:07,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899885303] [2021-11-25 18:04:07,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899885303] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:07,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528643761] [2021-11-25 18:04:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:07,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:07,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:07,907 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:07,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 18:04:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:08,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 53 conjunts are in the unsatisfiable core [2021-11-25 18:04:08,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:08,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:08,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:08,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:08,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-25 18:04:08,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:08,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,750 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:04:08,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2021-11-25 18:04:08,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:08,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:08,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:08,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:08,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:08,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:08,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:08,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-25 18:04:08,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-25 18:04:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:08,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:09,024 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_577 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-11-25 18:04:09,035 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_577 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-11-25 18:04:09,063 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_572) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-11-25 18:04:09,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-11-25 18:04:09,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-11-25 18:04:09,340 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|) (and (forall ((v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-11-25 18:04:09,627 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_566))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) is different from false [2021-11-25 18:04:10,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_55|) (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_566))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) is different from false [2021-11-25 18:04:10,823 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_55|) (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_577) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_566))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_578) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) is different from false [2021-11-25 18:04:13,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_55|) (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_577) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_566))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_578) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) is different from false [2021-11-25 18:04:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-11-25 18:04:14,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528643761] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:14,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [358066790] [2021-11-25 18:04:14,167 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2021-11-25 18:04:14,168 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:14,168 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:14,168 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:14,169 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:14,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:14,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:14,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:04:14,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:14,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:14,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2021-11-25 18:04:14,285 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2021-11-25 18:04:15,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:15,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:15,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:15,323 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:04:15,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:04:15,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:15,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:15,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:15,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:15,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:04:15,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-25 18:04:15,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:15,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:04:15,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:15,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:15,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:04:15,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:15,840 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-25 18:04:15,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-11-25 18:04:15,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:16,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:16,018 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-25 18:04:16,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 18:04:16,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:16,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-25 18:04:16,378 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:20,953 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4599#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= (select |#valid| |sll_append_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.offset|) (<= |sll_append_#in~sublist_length#1| 3) (<= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= |sll_append_#in~head#1.offset| 0) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= (+ |sll_append_~head#1.offset| 4) (select |#length| |sll_append_~head#1.base|)) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (or (not (= |sll_append_~temp~0#1.base| 0)) (not (= |sll_append_~temp~0#1.offset| 0))) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_~new_last~0#1.offset|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (= (select (select |#memory_$Pointer$.base| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.base|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 3 |sll_append_#in~sublist_length#1|) (<= 0 |sll_append_#in~head#1.offset|) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (not (= (select |#valid| |sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:20,953 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:20,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:20,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 31 [2021-11-25 18:04:20,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868704123] [2021-11-25 18:04:20,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:20,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-25 18:04:20,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:20,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-25 18:04:20,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1096, Unknown=10, NotChecked=770, Total=2070 [2021-11-25 18:04:20,956 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 32 states, 32 states have (on average 1.90625) internal successors, (61), 28 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:22,968 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_55|) (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_577) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_566))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_578) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) is different from false [2021-11-25 18:04:24,973 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_55|) (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_577) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_566))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_578) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0) (= |c_sll_append_#in~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (not (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 0))) is different from false [2021-11-25 18:04:26,978 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_55|) (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_566))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-11-25 18:04:28,984 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_566))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-11-25 18:04:30,990 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_54|) (and (forall ((v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-11-25 18:04:43,039 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-11-25 18:04:45,051 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) 0) 0))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_53| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_53|) (and (forall ((v_ArrVal_571 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_577) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_53| v_ArrVal_572) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-11-25 18:04:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:45,486 INFO L93 Difference]: Finished difference Result 146 states and 177 transitions. [2021-11-25 18:04:45,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-25 18:04:45,487 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.90625) internal successors, (61), 28 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-25 18:04:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:45,489 INFO L225 Difference]: With dead ends: 146 [2021-11-25 18:04:45,489 INFO L226 Difference]: Without dead ends: 146 [2021-11-25 18:04:45,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=244, Invalid=1367, Unknown=17, NotChecked=1564, Total=3192 [2021-11-25 18:04:45,491 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 11 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:45,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 1041 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 309 Unchecked, 0.2s Time] [2021-11-25 18:04:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-25 18:04:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2021-11-25 18:04:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 135 states have internal predecessors, (161), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2021-11-25 18:04:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2021-11-25 18:04:45,501 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 24 [2021-11-25 18:04:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:45,501 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2021-11-25 18:04:45,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.90625) internal successors, (61), 28 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2021-11-25 18:04:45,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 18:04:45,503 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:45,503 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:04:45,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:45,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-25 18:04:45,724 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:04:45,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash 118706273, now seen corresponding path program 1 times [2021-11-25 18:04:45,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:45,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581770005] [2021-11-25 18:04:45,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:45,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:04:45,847 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:45,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581770005] [2021-11-25 18:04:45,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581770005] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:45,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218881460] [2021-11-25 18:04:45,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:45,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:45,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:45,849 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:45,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 18:04:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:45,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-25 18:04:45,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-25 18:04:46,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-25 18:04:46,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218881460] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:46,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1354560265] [2021-11-25 18:04:46,129 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-11-25 18:04:46,130 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:46,130 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:46,130 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:46,131 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:46,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:46,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:46,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:04:46,402 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 38 for LOIs [2021-11-25 18:04:46,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:46,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:46,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:46,975 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:04:46,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-11-25 18:04:46,998 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:04:46,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:04:47,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:47,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:47,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:47,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:04:47,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-25 18:04:47,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:47,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:04:47,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:47,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:47,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:04:47,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:47,387 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-25 18:04:47,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-11-25 18:04:47,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:47,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:47,582 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-25 18:04:47,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 18:04:47,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:47,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-25 18:04:47,826 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:50,543 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5103#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= (select |#valid| |sll_append_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.offset|) (<= |sll_append_#in~sublist_length#1| 3) (<= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= |sll_append_#in~head#1.offset| 0) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= (+ |sll_append_~head#1.offset| 4) (select |#length| |sll_append_~head#1.base|)) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (or (not (= |sll_append_~temp~0#1.base| 0)) (not (= |sll_append_~temp~0#1.offset| 0))) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_~new_last~0#1.offset|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (= (select (select |#memory_$Pointer$.base| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.base|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 3 |sll_append_#in~sublist_length#1|) (<= 0 |sll_append_#in~head#1.offset|) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (not (= (select |#valid| |sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:50,543 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:50,543 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:50,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2021-11-25 18:04:50,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867818240] [2021-11-25 18:04:50,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:50,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 18:04:50,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:50,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 18:04:50,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2021-11-25 18:04:50,545 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:50,731 INFO L93 Difference]: Finished difference Result 182 states and 214 transitions. [2021-11-25 18:04:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 18:04:50,733 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-25 18:04:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:50,734 INFO L225 Difference]: With dead ends: 182 [2021-11-25 18:04:50,734 INFO L226 Difference]: Without dead ends: 182 [2021-11-25 18:04:50,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2021-11-25 18:04:50,736 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 205 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:50,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 477 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:04:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-11-25 18:04:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2021-11-25 18:04:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 139 states have (on average 1.4388489208633093) internal successors, (200), 165 states have internal predecessors, (200), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-25 18:04:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 211 transitions. [2021-11-25 18:04:50,745 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 211 transitions. Word has length 28 [2021-11-25 18:04:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:50,745 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 211 transitions. [2021-11-25 18:04:50,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:04:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 211 transitions. [2021-11-25 18:04:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-25 18:04:50,747 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:50,747 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:04:50,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:50,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 18:04:50,952 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:04:50,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:50,953 INFO L85 PathProgramCache]: Analyzing trace with hash -267842461, now seen corresponding path program 1 times [2021-11-25 18:04:50,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:50,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669062951] [2021-11-25 18:04:50,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:50,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:51,093 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:51,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669062951] [2021-11-25 18:04:51,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669062951] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:51,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816701118] [2021-11-25 18:04:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:51,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:51,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:51,095 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:51,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 18:04:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:51,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 18:04:51,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:51,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:04:51,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816701118] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:04:51,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [539685166] [2021-11-25 18:04:51,324 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-11-25 18:04:51,324 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:04:51,325 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:04:51,325 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:04:51,325 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:04:51,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:51,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:51,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:04:51,544 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 32 for LOIs [2021-11-25 18:04:51,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:51,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:51,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:52,010 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:04:52,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:04:52,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:52,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:52,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:52,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:04:52,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-25 18:04:52,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:04:52,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:52,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:04:52,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:52,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:52,347 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-25 18:04:52,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-11-25 18:04:52,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:52,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:04:52,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:04:52,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:52,505 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-25 18:04:52,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 18:04:52,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:52,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-25 18:04:52,738 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:04:55,436 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5655#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 5) (<= 0 |sll_append_#in~head#1.base|) (= (select |#valid| |sll_append_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.offset|) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_#in~sublist_length#1| 5) (<= 0 |sll_append_~head#1.base|) (<= |sll_append_sll_create_#in~len#1| 5) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 5) (<= (+ |sll_append_~head#1.offset| 4) (select |#length| |sll_append_~head#1.base|)) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (or (not (= |sll_append_~temp~0#1.base| 0)) (not (= |sll_append_~temp~0#1.offset| 0))) (<= |sll_append_~sublist_length#1| 5) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (= (select (select |#memory_$Pointer$.base| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.base|) (<= 3 |sll_append_#in~sublist_length#1|) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (not (= (select |#valid| |sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:04:55,436 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:04:55,436 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:04:55,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2021-11-25 18:04:55,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020922725] [2021-11-25 18:04:55,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:04:55,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-25 18:04:55,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:04:55,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-25 18:04:55,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-11-25 18:04:55,439 INFO L87 Difference]: Start difference. First operand 174 states and 211 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 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) [2021-11-25 18:04:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:04:55,710 INFO L93 Difference]: Finished difference Result 231 states and 269 transitions. [2021-11-25 18:04:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 18:04:55,711 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 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 28 [2021-11-25 18:04:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:04:55,714 INFO L225 Difference]: With dead ends: 231 [2021-11-25 18:04:55,714 INFO L226 Difference]: Without dead ends: 231 [2021-11-25 18:04:55,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2021-11-25 18:04:55,716 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 173 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:04:55,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 512 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 18:04:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-11-25 18:04:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 191. [2021-11-25 18:04:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.4743589743589745) internal successors, (230), 182 states have internal predecessors, (230), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-11-25 18:04:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 241 transitions. [2021-11-25 18:04:55,738 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 241 transitions. Word has length 28 [2021-11-25 18:04:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:04:55,738 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 241 transitions. [2021-11-25 18:04:55,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 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) [2021-11-25 18:04:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 241 transitions. [2021-11-25 18:04:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-25 18:04:55,739 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:04:55,739 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:04:55,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 18:04:55,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 18:04:55,940 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:04:55,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:04:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1718646116, now seen corresponding path program 2 times [2021-11-25 18:04:55,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:04:55,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221805132] [2021-11-25 18:04:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:04:55,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:04:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:04:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-25 18:04:56,183 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:04:56,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221805132] [2021-11-25 18:04:56,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221805132] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:04:56,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688884391] [2021-11-25 18:04:56,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:04:56,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:04:56,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:04:56,185 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:04:56,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 18:04:56,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-25 18:04:56,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:04:56,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 18:04:56,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:04:56,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:56,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:56,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:56,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:56,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:56,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-11-25 18:04:56,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:56,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:56,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:56,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:56,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:56,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:56,936 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:04:56,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2021-11-25 18:04:57,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:57,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:57,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:57,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:57,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:57,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:57,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:57,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:57,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:57,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:57,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:57,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:57,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:57,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:57,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:04:57,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:04:57,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-25 18:04:57,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-25 18:04:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 18:04:57,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:04:57,222 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_852 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_853 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-11-25 18:04:57,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_16| Int)) (or (and (forall ((v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|))) is different from false [2021-11-25 18:04:57,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_16| Int)) (or (and (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|))) is different from false [2021-11-25 18:04:59,490 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_73| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (forall ((|v_sll_append_~new_last~0#1.base_16| Int)) (or (and (forall ((v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|))))) is different from false [2021-11-25 18:04:59,727 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int)) (or (and (forall ((v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|))) is different from false [2021-11-25 18:05:00,152 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_74| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (and (forall ((v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|))) is different from false [2021-11-25 18:05:03,202 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_75|) (< 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|) (< |v_sll_append_sll_create_~new_head~0#1.offset_70| 0) (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (and (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_75| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_75|) |v_sll_append_sll_create_~new_head~0#1.offset_70| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_842) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|))))) is different from false [2021-11-25 18:05:03,728 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int) (|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_75|) (< 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (and (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_839 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_839))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75|) |v_sll_append_sll_create_~new_head~0#1.offset_70| |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_840) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_842) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |v_sll_append_sll_create_~new_head~0#1.offset_70| 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|))) is different from false [2021-11-25 18:05:04,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int) (|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_75|) (< 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (and (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_840) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_842) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_839 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_839))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75|) |v_sll_append_sll_create_~new_head~0#1.offset_70| 0))) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_76|) (< |v_sll_append_sll_create_~new_head~0#1.offset_70| 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|))) is different from false [2021-11-25 18:05:06,242 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int) (|v_sll_append_sll_create_~new_head~0#1.offset_70| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_75|) (< 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_76|) (and (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_839 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_839))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75|) |v_sll_append_sll_create_~new_head~0#1.offset_70| 0))) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_840) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_842) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (< |v_sll_append_sll_create_~new_head~0#1.offset_70| 0) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |v_sll_append_~new_last~0#1.base_16|))) is different from false [2021-11-25 18:05:08,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int) (|v_sll_append_sll_create_~new_head~0#1.offset_70| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_75|) (< 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_76|) (and (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_840) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_842) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_839 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_839))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75|) |v_sll_append_sll_create_~new_head~0#1.offset_70| 0))) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (< |v_sll_append_sll_create_~new_head~0#1.offset_70| 0) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |v_sll_append_~new_last~0#1.base_16|))) is different from false [2021-11-25 18:05:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 22 not checked. [2021-11-25 18:05:12,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688884391] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:05:12,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [461962567] [2021-11-25 18:05:12,960 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-11-25 18:05:12,960 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:05:12,961 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:05:12,961 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:05:12,961 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:05:12,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:12,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:12,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:05:13,150 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 32 for LOIs [2021-11-25 18:05:13,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:05:13,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:05:13,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:05:13,717 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:05:13,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:05:13,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-11-25 18:05:13,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:05:13,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:05:13,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:05:13,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:05:13,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-25 18:05:13,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:13,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:05:14,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:05:14,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:14,070 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-25 18:05:14,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-11-25 18:05:14,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:14,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:05:14,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:05:14,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:14,238 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-25 18:05:14,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 18:05:14,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:05:14,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-25 18:05:14,526 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:05:18,228 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6316#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 5) (<= 0 |sll_append_#in~head#1.base|) (= (select |#valid| |sll_append_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.offset|) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_#in~sublist_length#1| 5) (<= 0 |sll_append_~head#1.base|) (<= |sll_append_sll_create_#in~len#1| 5) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 5) (<= (+ |sll_append_~head#1.offset| 4) (select |#length| |sll_append_~head#1.base|)) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (or (not (= |sll_append_~temp~0#1.base| 0)) (not (= |sll_append_~temp~0#1.offset| 0))) (<= |sll_append_~sublist_length#1| 5) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 3 |sll_append_~sublist_length#1|) (= (select (select |#memory_$Pointer$.base| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.base|) (= |sll_append_sll_create_~new_head~0#1.offset| |sll_append_sll_create_~head~0#1.offset|) (<= 3 |sll_append_#in~sublist_length#1|) (= |#NULL.offset| 0) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (not (= (select |#valid| |sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:05:18,228 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:05:18,229 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:05:18,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 15] total 34 [2021-11-25 18:05:18,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998421319] [2021-11-25 18:05:18,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:05:18,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-25 18:05:18,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:05:18,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-25 18:05:18,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1241, Unknown=11, NotChecked=902, Total=2352 [2021-11-25 18:05:18,231 INFO L87 Difference]: Start difference. First operand 191 states and 241 transitions. Second operand has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 31 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:05:20,246 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int) (|v_sll_append_sll_create_~new_head~0#1.offset_70| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_75|) (< 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_76|) (and (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_840) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_842) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_839 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_839))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75|) |v_sll_append_sll_create_~new_head~0#1.offset_70| 0))) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))) (< |v_sll_append_sll_create_~new_head~0#1.offset_70| 0) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |v_sll_append_~new_last~0#1.base_16|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#head~1#1.base|) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) is different from false [2021-11-25 18:05:22,255 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|))) (and (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int) (|v_sll_append_sll_create_~new_head~0#1.offset_70| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_75|) (< 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_76|) (and (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_839 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_839))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_75| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_75|) |v_sll_append_sll_create_~new_head~0#1.offset_70| 0))) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_840) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_842) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (< |v_sll_append_sll_create_~new_head~0#1.offset_70| 0) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |v_sll_append_~new_last~0#1.base_16|))) (= |c_sll_append_#in~head#1.offset| 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (= (select .cse2 |c_sll_append_#in~head#1.offset|) 0) (= (select .cse2 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (= (select .cse0 0) 0) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|))) is different from false [2021-11-25 18:05:24,260 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int) (|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_75|) (< 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (and (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_840) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_842) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_839 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_839))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75|) |v_sll_append_sll_create_~new_head~0#1.offset_70| 0))) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_76|) (< |v_sll_append_sll_create_~new_head~0#1.offset_70| 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-11-25 18:05:26,266 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int) (|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_75|) (< 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (and (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_839 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_839))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_75|) |v_sll_append_sll_create_~new_head~0#1.offset_70| |c_sll_append_sll_create_~new_head~0#1.offset|))) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_840) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_842) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |v_sll_append_sll_create_~new_head~0#1.offset_70| 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-11-25 18:05:28,273 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_75|) (< 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|) (< |v_sll_append_sll_create_~new_head~0#1.offset_70| 0) (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (and (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_75| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_75|) |v_sll_append_sll_create_~new_head~0#1.offset_70| |c_sll_append_sll_create_~head~0#1.offset|)) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_842 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_842) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|))))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-11-25 18:05:30,292 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_74| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (and (forall ((v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (exists ((|sll_append_sll_create_~new_head~0#1.offset| Int) (|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (<= |sll_append_sll_create_~new_head~0#1.offset| 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (<= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0)) is different from false [2021-11-25 18:07:10,509 WARN L227 SmtUtils]: Spent 1.00m on a formula simplification. DAG size of input: 61 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:07:12,515 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_74| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_73| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (and (forall ((v_ArrVal_844 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_844) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= 0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|))) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_74|))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (exists ((|sll_append_sll_create_~new_head~0#1.offset| Int) (|sll_append_sll_create_~new_head~0#1.base| Int)) (and (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (<= |sll_append_sll_create_~new_head~0#1.offset| 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (<= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_73| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_73|) (forall ((|v_sll_append_~new_last~0#1.base_16| Int)) (or (and (forall ((v_ArrVal_847 (Array Int Int)) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_850) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_852) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_73| v_ArrVal_846) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_851) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_853) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|)))))) is different from false [2021-11-25 18:07:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:07:56,919 INFO L93 Difference]: Finished difference Result 230 states and 287 transitions. [2021-11-25 18:07:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 18:07:56,920 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 31 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-25 18:07:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:07:56,926 INFO L225 Difference]: With dead ends: 230 [2021-11-25 18:07:56,926 INFO L226 Difference]: Without dead ends: 230 [2021-11-25 18:07:56,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 168.6s TimeCoverageRelationStatistics Valid=247, Invalid=1425, Unknown=40, NotChecked=1710, Total=3422 [2021-11-25 18:07:56,928 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 12 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 489 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 18:07:56,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1161 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 306 Invalid, 0 Unknown, 489 Unchecked, 0.2s Time] [2021-11-25 18:07:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-25 18:07:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2021-11-25 18:07:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 188 states have (on average 1.4148936170212767) internal successors, (266), 216 states have internal predecessors, (266), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (10), 4 states have call predecessors, (10), 7 states have call successors, (10) [2021-11-25 18:07:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 283 transitions. [2021-11-25 18:07:56,942 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 283 transitions. Word has length 31 [2021-11-25 18:07:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:07:56,942 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 283 transitions. [2021-11-25 18:07:56,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 31 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:07:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 283 transitions. [2021-11-25 18:07:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-25 18:07:56,944 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:07:56,944 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:07:56,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 18:07:57,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 18:07:57,172 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting sll_appendErr10REQUIRES_VIOLATION === [sll_appendErr0REQUIRES_VIOLATION, sll_appendErr1REQUIRES_VIOLATION, sll_appendErr2REQUIRES_VIOLATION, sll_appendErr3REQUIRES_VIOLATION (and 38 more)] === [2021-11-25 18:07:57,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:07:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1495597889, now seen corresponding path program 2 times [2021-11-25 18:07:57,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:07:57,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14703364] [2021-11-25 18:07:57,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:07:57,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:07:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:07:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-25 18:07:57,490 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:07:57,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14703364] [2021-11-25 18:07:57,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14703364] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:07:57,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064166391] [2021-11-25 18:07:57,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:07:57,490 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:07:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:07:57,492 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:07:57,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eeaafbc3-7687-44f4-b6f6-8dae9bce8a1e/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 18:07:57,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 18:07:57,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:07:57,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 57 conjunts are in the unsatisfiable core [2021-11-25 18:07:57,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:07:57,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-25 18:07:58,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:58,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2021-11-25 18:07:58,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:58,192 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-11-25 18:07:58,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 18:07:58,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:07:58,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:07:58,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:58,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:07:58,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:58,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:07:58,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:58,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:07:58,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:58,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:07:58,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:58,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:07:58,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:58,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:07:58,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:58,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:07:58,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:58,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:07:58,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:58,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:07:58,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:07:58,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-25 18:07:58,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-25 18:07:58,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-25 18:07:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-25 18:07:58,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:07:58,749 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_960 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|))) (forall ((v_ArrVal_959 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2021-11-25 18:07:58,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (and (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-11-25 18:07:58,916 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_952) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_953) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-11-25 18:08:01,079 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_sll_create_~new_head~0#1.base_81| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_81|) (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_952) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_953) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) is different from false [2021-11-25 18:08:01,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_82| Int) (|v_sll_append_sll_create_~new_head~0#1.base_81| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_82|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_81|) (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_82| v_ArrVal_951) |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_953) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_82| v_ArrVal_950) |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_952) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-11-25 18:08:02,117 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_82| Int) (|v_sll_append_sll_create_~new_head~0#1.base_81| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_82|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_81|) (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_949) |v_sll_append_sll_create_~new_head~0#1.base_82| v_ArrVal_951) |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_953) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_948) |v_sll_append_sll_create_~new_head~0#1.base_82| v_ArrVal_950) |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_952) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2021-11-25 18:08:04,361 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_sll_append_~new_last~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_83| Int) (|v_sll_append_sll_create_~new_head~0#1.base_82| Int) (|v_sll_append_sll_create_~new_head~0#1.base_81| Int) (|v_sll_append_node_create_with_sublist_~new_node~0#1.base_29| Int)) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_29| |v_sll_append_~new_last~0#1.base_17|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_82|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_81|) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_948 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_83| v_ArrVal_948) |v_sll_append_sll_create_~new_head~0#1.base_82| v_ArrVal_950) |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_952) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_29| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_83| v_ArrVal_949) |v_sll_append_sll_create_~new_head~0#1.base_82| v_ArrVal_951) |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_953) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_29| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0))) (<= |c_#StackHeapBarrier| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_29|) (not (= (select (store |c_#valid| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_29| 1) |v_sll_append_sll_create_~new_head~0#1.base_83|) 0)))) is different from false [2021-11-25 18:08:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 12 not checked. [2021-11-25 18:08:11,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064166391] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:08:11,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2122719502] [2021-11-25 18:08:11,943 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2021-11-25 18:08:11,944 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:08:11,944 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:08:11,944 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:08:11,944 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:08:11,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:08:11,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:08:11,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:08:12,221 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 38 for LOIs [2021-11-25 18:08:12,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:08:12,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:08:12,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:08:12,824 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 18:08:12,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-11-25 18:08:12,852 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-25 18:08:12,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-25 18:08:12,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:08:12,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:08:12,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:08:12,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:08:13,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-11-25 18:08:13,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:08:13,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:08:13,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:08:13,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:08:13,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-25 18:08:13,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:08:13,250 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-11-25 18:08:13,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-11-25 18:08:13,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:08:13,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:08:13,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-25 18:08:13,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:08:13,436 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-25 18:08:13,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 33 [2021-11-25 18:08:13,666 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:08:17,489 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7038#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= (select |#valid| |sll_append_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.offset|) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= (+ |sll_append_~head#1.offset| 4) (select |#length| |sll_append_~head#1.base|)) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (or (not (= |sll_append_~temp~0#1.base| 0)) (not (= |sll_append_~temp~0#1.offset| 0))) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 3 |sll_append_~sublist_length#1|) (= (select (select |#memory_$Pointer$.base| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.base|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_~new_head~0#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (not (= (select |#valid| |sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2021-11-25 18:08:17,489 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:08:17,489 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:08:17,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 31 [2021-11-25 18:08:17,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364257939] [2021-11-25 18:08:17,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:08:17,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-25 18:08:17,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:08:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-25 18:08:17,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1394, Unknown=8, NotChecked=574, Total=2162 [2021-11-25 18:08:17,492 INFO L87 Difference]: Start difference. First operand 226 states and 283 transitions. Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 28 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:10:56,066 WARN L227 SmtUtils]: Spent 2.10m on a formula simplification. DAG size of input: 87 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:12:56,405 WARN L227 SmtUtils]: Spent 1.14m on a formula simplification. DAG size of input: 70 DAG size of output: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:12:58,407 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_~new_last~0#1.base_17| Int) (|v_sll_append_sll_create_~new_head~0#1.base_82| Int) (|v_sll_append_sll_create_~new_head~0#1.base_81| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_82|) (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_81|) (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_82| v_ArrVal_951) |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_953) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_82| v_ArrVal_950) |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_952) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_81| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_81|) (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_952) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_953) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) (<= 0 |c_sll_append_sll_create_~head~0#1.offset|) (<= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|)) is different from false [2021-11-25 18:14:10,682 WARN L227 SmtUtils]: Spent 32.09s on a formula simplification. DAG size of input: 54 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:14:12,694 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_81| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_81|) (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_952) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_953) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) (<= 0 |c_sll_append_sll_create_~head~0#1.offset|) (<= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (and (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) is different from false [2021-11-25 18:15:42,912 WARN L227 SmtUtils]: Spent 36.08s on a formula simplification. DAG size of input: 59 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-25 18:16:39,099 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|))) (and (= (select .cse0 |c_sll_append_~head#1.offset|) 0) (= (select .cse0 0) 0) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_81| Int)) (or (<= |c_#StackHeapBarrier| |v_sll_append_sll_create_~new_head~0#1.base_81|) (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_952) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_81| v_ArrVal_953) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_~head#1.base|) (= (select .cse1 0) 0) (< (+ |c_sll_append_node_create_with_sublist_~new_node~0#1.base| 1) |c_sll_append_~head#1.base|) (= (select .cse1 |c_sll_append_~head#1.offset|) 0) (not (= |c_sll_append_~head#1.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base|)) (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (and (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) is different from false [2021-11-25 18:16:39,107 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (not (= |c_sll_append_~head#1.base| |c_sll_append_sll_create_~new_head~0#1.base|)) (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (and (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_952) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_953) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (not (= |c_sll_append_~head#1.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base|))) is different from false [2021-11-25 18:17:03,154 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (< (+ |c_sll_append_node_create_with_sublist_~new_node~0#1.base| 1) |c_sll_append_~head#1.base|) (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (and (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) is different from false [2021-11-25 18:17:05,158 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0) (not (= |c_sll_append_~head#1.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base|)) (forall ((|v_sll_append_~new_last~0#1.base_17| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_17|) (and (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_958) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_959) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_957 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_957) |v_sll_append_~new_last~0#1.base_17| v_ArrVal_960) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) is different from false