./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/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_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:47:44,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:47:44,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:47:44,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:47:44,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:47:44,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:47:44,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:47:44,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:47:44,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:47:44,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:47:44,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:47:44,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:47:44,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:47:44,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:47:44,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:47:44,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:47:44,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:47:44,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:47:44,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:47:44,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:47:44,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:47:44,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:47:44,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:47:44,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:47:44,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:47:44,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:47:44,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:47:44,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:47:44,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:47:44,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:47:44,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:47:44,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:47:44,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:47:44,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:47:44,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:47:44,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:47:44,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:47:44,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:47:44,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:47:44,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:47:44,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:47:44,726 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-11-03 02:47:44,770 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:47:44,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:47:44,771 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:47:44,771 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:47:44,772 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:47:44,773 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:47:44,773 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:47:44,773 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:47:44,773 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:47:44,773 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:47:44,774 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:47:44,775 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:47:44,775 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:47:44,775 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:47:44,775 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:47:44,776 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:47:44,776 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:47:44,776 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:47:44,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 02:47:44,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 02:47:44,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:47:44,779 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:47:44,779 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:47:44,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:47:44,779 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:47:44,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:47:44,780 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 02:47:44,780 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 02:47:44,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:47:44,780 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:47:44,781 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:47:44,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:47:44,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:47:44,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:47:44,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:47:44,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:47:44,782 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:47:44,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:47:44,782 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:47:44,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:47:44,783 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:47:44,783 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/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_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI 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 [2022-11-03 02:47:45,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:47:45,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:47:45,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:47:45,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:47:45,080 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:47:45,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-11-03 02:47:45,145 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/data/7af3dbaa7/3527b4903e914888b3389373e997a1b0/FLAGf98e4f6c1 [2022-11-03 02:47:45,721 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:47:45,722 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-11-03 02:47:45,745 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/data/7af3dbaa7/3527b4903e914888b3389373e997a1b0/FLAGf98e4f6c1 [2022-11-03 02:47:45,996 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/data/7af3dbaa7/3527b4903e914888b3389373e997a1b0 [2022-11-03 02:47:45,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:47:46,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:47:46,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:47:46,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:47:46,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:47:46,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:47:45" (1/1) ... [2022-11-03 02:47:46,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31092cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46, skipping insertion in model container [2022-11-03 02:47:46,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:47:45" (1/1) ... [2022-11-03 02:47:46,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:47:46,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:47:46,392 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_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-11-03 02:47:46,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:47:46,416 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:47:46,495 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_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-11-03 02:47:46,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:47:46,521 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:47:46,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46 WrapperNode [2022-11-03 02:47:46,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:47:46,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:47:46,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:47:46,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:47:46,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46" (1/1) ... [2022-11-03 02:47:46,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46" (1/1) ... [2022-11-03 02:47:46,603 INFO L138 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-11-03 02:47:46,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:47:46,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:47:46,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:47:46,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:47:46,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46" (1/1) ... [2022-11-03 02:47:46,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46" (1/1) ... [2022-11-03 02:47:46,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46" (1/1) ... [2022-11-03 02:47:46,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46" (1/1) ... [2022-11-03 02:47:46,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46" (1/1) ... [2022-11-03 02:47:46,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46" (1/1) ... [2022-11-03 02:47:46,657 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46" (1/1) ... [2022-11-03 02:47:46,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46" (1/1) ... [2022-11-03 02:47:46,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:47:46,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:47:46,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:47:46,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:47:46,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46" (1/1) ... [2022-11-03 02:47:46,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:47:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:47:46,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:47:46,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:47:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-03 02:47:46,761 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-03 02:47:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:47:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:47:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:47:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:47:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2022-11-03 02:47:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2022-11-03 02:47:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:47:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:47:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 02:47:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:47:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:47:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:47:46,974 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:47:46,976 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:47:47,016 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-03 02:47:47,457 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:47:47,553 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:47:47,554 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-03 02:47:47,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:47:47 BoogieIcfgContainer [2022-11-03 02:47:47,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:47:47,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:47:47,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:47:47,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:47:47,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:47:45" (1/3) ... [2022-11-03 02:47:47,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193fd5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:47:47, skipping insertion in model container [2022-11-03 02:47:47,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:47:46" (2/3) ... [2022-11-03 02:47:47,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193fd5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:47:47, skipping insertion in model container [2022-11-03 02:47:47,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:47:47" (3/3) ... [2022-11-03 02:47:47,586 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2022-11-03 02:47:47,605 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:47:47,605 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-11-03 02:47:47,653 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:47:47,660 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@d3d95c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:47:47,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-11-03 02:47:47,665 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) [2022-11-03 02:47:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:47:47,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:47,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:47,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:47:47,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash -303362409, now seen corresponding path program 1 times [2022-11-03 02:47:47,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:47,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212192103] [2022-11-03 02:47:47,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:47:47,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:47,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212192103] [2022-11-03 02:47:47,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212192103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:47:47,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:47:47,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:47:47,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290578176] [2022-11-03 02:47:47,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:47:47,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:47:47,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:47,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:47:47,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:47:47,975 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) [2022-11-03 02:47:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:48,078 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2022-11-03 02:47:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:47:48,080 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 [2022-11-03 02:47:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:48,089 INFO L225 Difference]: With dead ends: 105 [2022-11-03 02:47:48,089 INFO L226 Difference]: Without dead ends: 100 [2022-11-03 02:47:48,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:47:48,094 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:47:48,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 169 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:47:48,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-03 02:47:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-11-03 02:47:48,133 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) [2022-11-03 02:47:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-11-03 02:47:48,137 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 8 [2022-11-03 02:47:48,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:48,138 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-11-03 02:47:48,138 INFO L496 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) [2022-11-03 02:47:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-11-03 02:47:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:47:48,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:48,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:48,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:47:48,140 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:47:48,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:48,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1366900647, now seen corresponding path program 1 times [2022-11-03 02:47:48,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:48,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956934169] [2022-11-03 02:47:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:48,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:47:48,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:48,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956934169] [2022-11-03 02:47:48,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956934169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:47:48,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:47:48,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:47:48,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110614680] [2022-11-03 02:47:48,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:47:48,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:47:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:48,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:47:48,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:47:48,438 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) [2022-11-03 02:47:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:48,673 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2022-11-03 02:47:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:47:48,673 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 [2022-11-03 02:47:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:48,675 INFO L225 Difference]: With dead ends: 141 [2022-11-03 02:47:48,685 INFO L226 Difference]: Without dead ends: 141 [2022-11-03 02:47:48,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:47:48,687 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 88 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:47:48,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 467 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:47:48,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-03 02:47:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2022-11-03 02:47:48,705 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) [2022-11-03 02:47:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2022-11-03 02:47:48,708 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 10 [2022-11-03 02:47:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:48,708 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2022-11-03 02:47:48,708 INFO L496 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) [2022-11-03 02:47:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2022-11-03 02:47:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:47:48,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:48,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:48,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:47:48,710 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:47:48,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:48,710 INFO L85 PathProgramCache]: Analyzing trace with hash 575489218, now seen corresponding path program 1 times [2022-11-03 02:47:48,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:48,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886701604] [2022-11-03 02:47:48,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:48,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:47:48,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:48,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886701604] [2022-11-03 02:47:48,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886701604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:47:48,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:47:48,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:47:48,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765250382] [2022-11-03 02:47:48,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:47:48,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:47:48,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:48,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:47:48,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:47:48,863 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) [2022-11-03 02:47:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:49,039 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2022-11-03 02:47:49,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:47:49,040 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 [2022-11-03 02:47:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:49,043 INFO L225 Difference]: With dead ends: 146 [2022-11-03 02:47:49,043 INFO L226 Difference]: Without dead ends: 146 [2022-11-03 02:47:49,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:47:49,045 INFO L413 NwaCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:47:49,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 154 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:47:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-03 02:47:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 117. [2022-11-03 02:47:49,054 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) [2022-11-03 02:47:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2022-11-03 02:47:49,056 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 11 [2022-11-03 02:47:49,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:49,057 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2022-11-03 02:47:49,057 INFO L496 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) [2022-11-03 02:47:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2022-11-03 02:47:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:47:49,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:49,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:49,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:47:49,058 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:47:49,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash 575489217, now seen corresponding path program 1 times [2022-11-03 02:47:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:49,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306554444] [2022-11-03 02:47:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:49,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:47:49,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:49,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306554444] [2022-11-03 02:47:49,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306554444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:47:49,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:47:49,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:47:49,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776509177] [2022-11-03 02:47:49,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:47:49,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:47:49,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:49,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:47:49,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:47:49,149 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) [2022-11-03 02:47:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:49,296 INFO L93 Difference]: Finished difference Result 145 states and 182 transitions. [2022-11-03 02:47:49,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:47:49,297 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 [2022-11-03 02:47:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:49,298 INFO L225 Difference]: With dead ends: 145 [2022-11-03 02:47:49,298 INFO L226 Difference]: Without dead ends: 145 [2022-11-03 02:47:49,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:47:49,300 INFO L413 NwaCegarLoop]: 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 [2022-11-03 02:47:49,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 149 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:47:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-03 02:47:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2022-11-03 02:47:49,308 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) [2022-11-03 02:47:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 149 transitions. [2022-11-03 02:47:49,311 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 149 transitions. Word has length 11 [2022-11-03 02:47:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:49,311 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 149 transitions. [2022-11-03 02:47:49,311 INFO L496 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) [2022-11-03 02:47:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 149 transitions. [2022-11-03 02:47:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:47:49,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:49,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:49,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:47:49,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:47:49,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:49,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1631077593, now seen corresponding path program 1 times [2022-11-03 02:47:49,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:49,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516948954] [2022-11-03 02:47:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:49,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:47:49,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:49,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516948954] [2022-11-03 02:47:49,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516948954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:47:49,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221244472] [2022-11-03 02:47:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:49,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:47:49,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:47:49,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:47:49,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:47:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:49,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:47:49,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:47:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:47:49,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:47:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:47:49,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221244472] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:47:49,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1659255686] [2022-11-03 02:47:49,814 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-03 02:47:49,814 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:47:49,818 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:47:49,824 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:47:49,824 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:47:49,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:49,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:49,904 INFO L390 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 [2022-11-03 02:47:50,414 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-03 02:47:50,457 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:47:50,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1659255686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:47:50,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:47:50,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 3, 3] total 17 [2022-11-03 02:47:50,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095610075] [2022-11-03 02:47:50,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:47:50,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:47:50,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:50,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:47:50,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:47:50,959 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) [2022-11-03 02:47:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:51,462 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2022-11-03 02:47:51,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:47:51,463 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 [2022-11-03 02:47:51,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:51,464 INFO L225 Difference]: With dead ends: 131 [2022-11-03 02:47:51,464 INFO L226 Difference]: Without dead ends: 131 [2022-11-03 02:47:51,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:47:51,466 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 64 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:47:51,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 263 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:47:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-03 02:47:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2022-11-03 02:47:51,472 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) [2022-11-03 02:47:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 153 transitions. [2022-11-03 02:47:51,474 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 153 transitions. Word has length 12 [2022-11-03 02:47:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:51,474 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 153 transitions. [2022-11-03 02:47:51,475 INFO L496 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) [2022-11-03 02:47:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2022-11-03 02:47:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:47:51,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:51,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:51,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 02:47:51,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:47:51,701 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:47:51,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1005403790, now seen corresponding path program 1 times [2022-11-03 02:47:51,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:51,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121920912] [2022-11-03 02:47:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:51,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:47:51,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:51,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121920912] [2022-11-03 02:47:51,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121920912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:47:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16602123] [2022-11-03 02:47:51,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:51,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:47:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:47:51,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:47:51,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:47:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:51,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 02:47:51,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:47:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:47:52,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:47:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:47:52,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16602123] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:47:52,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [309348495] [2022-11-03 02:47:52,083 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 02:47:52,084 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:47:52,084 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:47:52,084 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:47:52,085 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:47:52,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:52,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:52,110 INFO L390 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 [2022-11-03 02:47:52,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:52,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:52,236 INFO L390 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 [2022-11-03 02:47:52,246 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-03 02:47:53,265 INFO L390 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 [2022-11-03 02:47:53,273 INFO L390 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 [2022-11-03 02:47:53,285 INFO L390 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 [2022-11-03 02:47:53,325 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:47:53,325 INFO L390 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 [2022-11-03 02:47:53,338 INFO L390 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 [2022-11-03 02:47:53,366 INFO L390 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 [2022-11-03 02:47:53,374 INFO L390 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 [2022-11-03 02:47:53,385 INFO L390 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 [2022-11-03 02:47:53,524 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:47:55,919 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_#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|) (not (< 0 |sll_append_sll_create_~len#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 [2022-11-03 02:47:55,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:47:55,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:47:55,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-11-03 02:47:55,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908733563] [2022-11-03 02:47:55,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:47:55,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:47:55,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:55,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:47:55,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:47:55,922 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) [2022-11-03 02:47:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:56,332 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2022-11-03 02:47:56,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:47:56,333 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 [2022-11-03 02:47:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:56,335 INFO L225 Difference]: With dead ends: 212 [2022-11-03 02:47:56,335 INFO L226 Difference]: Without dead ends: 212 [2022-11-03 02:47:56,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2022-11-03 02:47:56,336 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 220 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:47:56,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 968 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:47:56,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-03 02:47:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 119. [2022-11-03 02:47:56,349 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) [2022-11-03 02:47:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2022-11-03 02:47:56,350 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 13 [2022-11-03 02:47:56,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:56,350 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2022-11-03 02:47:56,350 INFO L496 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) [2022-11-03 02:47:56,351 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2022-11-03 02:47:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:47:56,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:56,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:56,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:47:56,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:47:56,552 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:47:56,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1574251492, now seen corresponding path program 1 times [2022-11-03 02:47:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:56,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050614158] [2022-11-03 02:47:56,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:56,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:47:56,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:56,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050614158] [2022-11-03 02:47:56,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050614158] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:47:56,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201181015] [2022-11-03 02:47:56,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:56,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:47:56,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:47:56,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:47:56,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:47:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:56,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:47:56,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:47:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:47:56,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:47:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:47:56,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201181015] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:47:56,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1925536298] [2022-11-03 02:47:56,776 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-03 02:47:56,777 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:47:56,777 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:47:56,777 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:47:56,778 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:47:56,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:56,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:47:56,799 INFO L390 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 [2022-11-03 02:47:57,040 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-03 02:47:57,582 INFO L390 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 [2022-11-03 02:47:57,602 INFO L390 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 [2022-11-03 02:47:57,613 INFO L390 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 [2022-11-03 02:47:57,647 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:47:57,647 INFO L390 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 [2022-11-03 02:47:57,660 INFO L390 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 [2022-11-03 02:47:57,684 INFO L390 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 [2022-11-03 02:47:57,695 INFO L390 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 [2022-11-03 02:47:57,704 INFO L390 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 [2022-11-03 02:47:57,777 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:47:59,122 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_#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|) (not (< 0 |sll_append_sll_create_~len#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 [2022-11-03 02:47:59,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:47:59,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:47:59,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-03 02:47:59,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638274576] [2022-11-03 02:47:59,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:47:59,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:47:59,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:47:59,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:47:59,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:47:59,125 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) [2022-11-03 02:47:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:47:59,238 INFO L93 Difference]: Finished difference Result 165 states and 201 transitions. [2022-11-03 02:47:59,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:47:59,239 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 [2022-11-03 02:47:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:47:59,240 INFO L225 Difference]: With dead ends: 165 [2022-11-03 02:47:59,240 INFO L226 Difference]: Without dead ends: 165 [2022-11-03 02:47:59,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:47:59,241 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 74 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:47:59,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 261 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:47:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-03 02:47:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2022-11-03 02:47:59,247 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) [2022-11-03 02:47:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions. [2022-11-03 02:47:59,249 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 15 [2022-11-03 02:47:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:47:59,249 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions. [2022-11-03 02:47:59,249 INFO L496 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) [2022-11-03 02:47:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2022-11-03 02:47:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:47:59,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:47:59,251 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:47:59,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:47:59,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 02:47:59,477 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:47:59,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:47:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash 13207570, now seen corresponding path program 2 times [2022-11-03 02:47:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:47:59,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755036032] [2022-11-03 02:47:59,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:47:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:47:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:47:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:47:59,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:47:59,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755036032] [2022-11-03 02:47:59,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755036032] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:47:59,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883943407] [2022-11-03 02:47:59,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:47:59,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:47:59,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:47:59,688 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:47:59,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:47:59,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:47:59,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:47:59,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 02:47:59,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:47:59,820 INFO L390 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 [2022-11-03 02:47:59,841 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:47:59,841 INFO L390 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 [2022-11-03 02:47:59,881 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:47:59,882 INFO L390 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 [2022-11-03 02:47:59,905 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:47:59,905 INFO L390 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 [2022-11-03 02:47:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:47:59,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:48:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:48:00,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883943407] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:48:00,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1914672087] [2022-11-03 02:48:00,052 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 02:48:00,052 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:48:00,052 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:48:00,052 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:48:00,053 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:48:00,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:00,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:00,072 INFO L390 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 [2022-11-03 02:48:00,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:00,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:00,145 INFO L390 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 [2022-11-03 02:48:00,152 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-03 02:48:00,938 INFO L390 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 [2022-11-03 02:48:00,947 INFO L390 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 [2022-11-03 02:48:00,956 INFO L390 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 [2022-11-03 02:48:00,994 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:48:00,994 INFO L390 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 [2022-11-03 02:48:01,022 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:48:01,023 INFO L390 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 [2022-11-03 02:48:01,049 INFO L390 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 [2022-11-03 02:48:01,057 INFO L390 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 [2022-11-03 02:48:01,067 INFO L390 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 [2022-11-03 02:48:01,159 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:48:03,024 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_#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|) (not (< 0 |sll_append_sll_create_~len#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 [2022-11-03 02:48:03,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:48:03,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:48:03,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-03 02:48:03,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932388169] [2022-11-03 02:48:03,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:48:03,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:48:03,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:48:03,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:48:03,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:48:03,026 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) [2022-11-03 02:48:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:48:03,086 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2022-11-03 02:48:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:48:03,088 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 [2022-11-03 02:48:03,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:48:03,089 INFO L225 Difference]: With dead ends: 132 [2022-11-03 02:48:03,089 INFO L226 Difference]: Without dead ends: 132 [2022-11-03 02:48:03,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:48:03,090 INFO L413 NwaCegarLoop]: 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 [2022-11-03 02:48:03,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 180 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-11-03 02:48:03,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-03 02:48:03,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-03 02:48:03,095 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) [2022-11-03 02:48:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2022-11-03 02:48:03,096 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 19 [2022-11-03 02:48:03,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:48:03,097 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2022-11-03 02:48:03,097 INFO L496 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) [2022-11-03 02:48:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2022-11-03 02:48:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:48:03,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:48:03,098 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:48:03,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-03 02:48:03,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-03 02:48:03,312 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:48:03,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:48:03,313 INFO L85 PathProgramCache]: Analyzing trace with hash 13207571, now seen corresponding path program 1 times [2022-11-03 02:48:03,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:48:03,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359373402] [2022-11-03 02:48:03,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:48:03,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:48:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:48:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:48:03,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:48:03,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359373402] [2022-11-03 02:48:03,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359373402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:48:03,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766812178] [2022-11-03 02:48:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:48:03,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:48:03,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:48:03,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:48:03,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:48:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:48:03,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 02:48:03,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:48:03,706 INFO L390 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 [2022-11-03 02:48:03,711 INFO L390 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 [2022-11-03 02:48:03,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,748 INFO L390 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 [2022-11-03 02:48:03,765 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:48:03,765 INFO L390 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 [2022-11-03 02:48:03,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:03,853 INFO L390 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 [2022-11-03 02:48:03,888 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:48:03,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-03 02:48:04,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:04,023 INFO L390 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 [2022-11-03 02:48:04,044 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-03 02:48:04,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-03 02:48:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:48:04,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:48:13,562 WARN L234 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:48:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:48:13,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766812178] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:48:13,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1774708390] [2022-11-03 02:48:13,674 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-11-03 02:48:13,675 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:48:13,675 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:48:13,675 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:48:13,675 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:48:13,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:13,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:13,692 INFO L390 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 [2022-11-03 02:48:13,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:13,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:13,756 INFO L390 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 [2022-11-03 02:48:13,762 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-03 02:48:14,494 INFO L390 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 [2022-11-03 02:48:14,501 INFO L390 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 [2022-11-03 02:48:14,508 INFO L390 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 [2022-11-03 02:48:14,540 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:48:14,541 INFO L390 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 [2022-11-03 02:48:14,568 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:48:14,568 INFO L390 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 [2022-11-03 02:48:14,594 INFO L390 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 [2022-11-03 02:48:14,601 INFO L390 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 [2022-11-03 02:48:14,608 INFO L390 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 [2022-11-03 02:48:14,703 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:48:16,857 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2783#(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_#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|) (not (< 0 |sll_append_sll_create_~len#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 [2022-11-03 02:48:16,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:48:16,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:48:16,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-11-03 02:48:16,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968103237] [2022-11-03 02:48:16,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:48:16,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:48:16,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:48:16,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:48:16,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:48:16,859 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 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) [2022-11-03 02:48:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:48:17,095 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2022-11-03 02:48:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:48:17,096 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 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 [2022-11-03 02:48:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:48:17,097 INFO L225 Difference]: With dead ends: 133 [2022-11-03 02:48:17,097 INFO L226 Difference]: Without dead ends: 133 [2022-11-03 02:48:17,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:48:17,100 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 83 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:48:17,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 196 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 128 Unchecked, 0.1s Time] [2022-11-03 02:48:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-03 02:48:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2022-11-03 02:48:17,117 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) [2022-11-03 02:48:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2022-11-03 02:48:17,123 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 19 [2022-11-03 02:48:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:48:17,124 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2022-11-03 02:48:17,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 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) [2022-11-03 02:48:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2022-11-03 02:48:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:48:17,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:48:17,128 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:48:17,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:48:17,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:48:17,349 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting sll_appendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:48:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:48:17,349 INFO L85 PathProgramCache]: Analyzing trace with hash -192183934, now seen corresponding path program 1 times [2022-11-03 02:48:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:48:17,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800855591] [2022-11-03 02:48:17,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:48:17,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:48:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:48:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:48:17,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:48:17,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800855591] [2022-11-03 02:48:17,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800855591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:48:17,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:48:17,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:48:17,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263588829] [2022-11-03 02:48:17,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:48:17,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:48:17,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:48:17,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:48:17,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:48:17,440 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) [2022-11-03 02:48:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:48:17,543 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-11-03 02:48:17,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:48:17,544 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 [2022-11-03 02:48:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:48:17,546 INFO L225 Difference]: With dead ends: 129 [2022-11-03 02:48:17,547 INFO L226 Difference]: Without dead ends: 129 [2022-11-03 02:48:17,547 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:48:17,547 INFO L413 NwaCegarLoop]: 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 [2022-11-03 02:48:17,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 144 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:48:17,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-03 02:48:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-03 02:48:17,551 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) [2022-11-03 02:48:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2022-11-03 02:48:17,553 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 21 [2022-11-03 02:48:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:48:17,553 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2022-11-03 02:48:17,553 INFO L496 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) [2022-11-03 02:48:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2022-11-03 02:48:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:48:17,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:48:17,555 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:48:17,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:48:17,555 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting sll_appendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:48:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:48:17,556 INFO L85 PathProgramCache]: Analyzing trace with hash -192183933, now seen corresponding path program 1 times [2022-11-03 02:48:17,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:48:17,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274677751] [2022-11-03 02:48:17,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:48:17,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:48:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:48:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:48:17,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:48:17,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274677751] [2022-11-03 02:48:17,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274677751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:48:17,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:48:17,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:48:17,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9501075] [2022-11-03 02:48:17,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:48:17,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:48:17,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:48:17,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:48:17,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:48:17,773 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) [2022-11-03 02:48:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:48:17,877 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2022-11-03 02:48:17,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:48:17,878 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 [2022-11-03 02:48:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:48:17,879 INFO L225 Difference]: With dead ends: 128 [2022-11-03 02:48:17,879 INFO L226 Difference]: Without dead ends: 128 [2022-11-03 02:48:17,879 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:48:17,880 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 49 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:48:17,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 207 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:48:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-03 02:48:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-11-03 02:48:17,883 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) [2022-11-03 02:48:17,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2022-11-03 02:48:17,884 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 21 [2022-11-03 02:48:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:48:17,885 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2022-11-03 02:48:17,885 INFO L496 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) [2022-11-03 02:48:17,885 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-11-03 02:48:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:48:17,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:48:17,886 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:48:17,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:48:17,886 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:48:17,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:48:17,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1662734635, now seen corresponding path program 1 times [2022-11-03 02:48:17,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:48:17,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421257029] [2022-11-03 02:48:17,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:48:17,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:48:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:48:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:48:18,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:48:18,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421257029] [2022-11-03 02:48:18,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421257029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:48:18,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984481769] [2022-11-03 02:48:18,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:48:18,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:48:18,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:48:18,279 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:48:18,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:48:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:48:18,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:48:18,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:48:18,455 INFO L390 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 [2022-11-03 02:48:18,491 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:48:18,491 INFO L390 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 [2022-11-03 02:48:18,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:18,536 INFO L390 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 [2022-11-03 02:48:18,562 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:48:18,562 INFO L390 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 [2022-11-03 02:48:18,631 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-03 02:48:18,631 INFO L390 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 [2022-11-03 02:48:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:48:18,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:48:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:48:18,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984481769] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:48:18,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [484655361] [2022-11-03 02:48:18,998 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:48:18,998 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:48:18,999 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:48:18,999 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:48:18,999 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:48:19,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:19,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:19,015 INFO L390 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 [2022-11-03 02:48:19,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:19,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:19,083 INFO L390 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 [2022-11-03 02:48:19,088 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-03 02:48:19,757 INFO L390 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 [2022-11-03 02:48:19,765 INFO L390 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 [2022-11-03 02:48:19,774 INFO L390 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 [2022-11-03 02:48:19,803 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:48:19,804 INFO L390 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 [2022-11-03 02:48:19,832 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:48:19,832 INFO L390 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 [2022-11-03 02:48:19,857 INFO L390 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 [2022-11-03 02:48:19,866 INFO L390 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 [2022-11-03 02:48:19,875 INFO L390 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 [2022-11-03 02:48:19,983 INFO L390 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 [2022-11-03 02:48:20,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:20,045 INFO L390 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 [2022-11-03 02:48:20,086 INFO L390 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 [2022-11-03 02:48:20,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:20,190 INFO L390 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 [2022-11-03 02:48:20,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:20,270 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:48:20,271 INFO L390 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 [2022-11-03 02:48:20,318 INFO L390 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 [2022-11-03 02:48:20,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:20,409 INFO L390 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 [2022-11-03 02:48:20,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:20,467 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:48:20,468 INFO L390 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 [2022-11-03 02:48:20,492 INFO L390 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 [2022-11-03 02:48:20,606 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:48:23,553 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3733#(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 [2022-11-03 02:48:23,553 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:48:23,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:48:23,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-03 02:48:23,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339033907] [2022-11-03 02:48:23,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:48:23,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:48:23,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:48:23,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:48:23,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2022-11-03 02:48:23,555 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) [2022-11-03 02:48:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:48:23,781 INFO L93 Difference]: Finished difference Result 176 states and 215 transitions. [2022-11-03 02:48:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:48:23,781 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 [2022-11-03 02:48:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:48:23,782 INFO L225 Difference]: With dead ends: 176 [2022-11-03 02:48:23,783 INFO L226 Difference]: Without dead ends: 176 [2022-11-03 02:48:23,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2022-11-03 02:48:23,784 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 91 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:48:23,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 349 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 204 Unchecked, 0.2s Time] [2022-11-03 02:48:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-03 02:48:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2022-11-03 02:48:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 124 states have (on average 1.6048387096774193) internal successors, (199), 159 states have internal predecessors, (199), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 02:48:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 213 transitions. [2022-11-03 02:48:23,790 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 213 transitions. Word has length 22 [2022-11-03 02:48:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:48:23,790 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 213 transitions. [2022-11-03 02:48:23,791 INFO L496 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) [2022-11-03 02:48:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 213 transitions. [2022-11-03 02:48:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:48:23,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:48:23,792 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:48:23,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:48:23,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 02:48:23,993 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting sll_appendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:48:23,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:48:23,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1662734634, now seen corresponding path program 1 times [2022-11-03 02:48:23,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:48:23,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544841876] [2022-11-03 02:48:23,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:48:23,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:48:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:48:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:48:24,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:48:24,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544841876] [2022-11-03 02:48:24,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544841876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:48:24,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851154747] [2022-11-03 02:48:24,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:48:24,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:48:24,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:48:24,440 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:48:24,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:48:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:48:24,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 02:48:24,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:48:24,595 INFO L390 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 [2022-11-03 02:48:24,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:24,661 INFO L390 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 [2022-11-03 02:48:24,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:24,690 INFO L390 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 [2022-11-03 02:48:24,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:24,712 INFO L390 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 [2022-11-03 02:48:24,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:24,740 INFO L390 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 [2022-11-03 02:48:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:48:24,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:48:28,926 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_472 Int) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_473 Int)) (<= (+ |c_sll_append_~head#1.offset| 4) (select (store (store |c_#length| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_472) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_473) |c_sll_append_~head#1.base|))))))) (<= 0 |c_sll_append_~head#1.offset|)) is different from false [2022-11-03 02:48:31,009 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_471 Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_472 Int) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_473 Int)) (<= (+ |c_sll_append_~head#1.offset| 4) (select (store (store (store |c_#length| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_471) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_472) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_473) |c_sll_append_~head#1.base|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))))) (<= 0 |c_sll_append_~head#1.offset|)) is different from false [2022-11-03 02:48:33,126 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 |c_sll_append_#in~head#1.offset|) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| Int)) (or (forall ((v_ArrVal_470 Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_471 Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_472 Int) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_473 Int)) (<= (+ |c_sll_append_#in~head#1.offset| 4) (select (store (store (store (store |c_#length| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| v_ArrVal_470) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_471) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_472) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_473) |c_sll_append_#in~head#1.base|))))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:48:35,181 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| Int)) (or (forall ((v_ArrVal_470 Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_471 Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_472 Int) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_473 Int)) (<= (+ 4 |c_ULTIMATE.start_main_~#head~1#1.offset|) (select (store (store (store (store |c_#length| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| v_ArrVal_470) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_471) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_472) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_473) |c_ULTIMATE.start_main_~#head~1#1.base|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| |c_#StackHeapBarrier|)))) (<= 0 |c_ULTIMATE.start_main_~#head~1#1.offset|)) is different from false [2022-11-03 02:48:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-03 02:48:35,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851154747] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:48:35,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1008603352] [2022-11-03 02:48:35,319 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 02:48:35,319 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:48:35,320 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:48:35,320 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:48:35,320 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:48:35,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:35,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:35,336 INFO L390 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 [2022-11-03 02:48:35,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:35,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:35,397 INFO L390 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 [2022-11-03 02:48:35,402 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-03 02:48:36,064 INFO L390 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 [2022-11-03 02:48:36,071 INFO L390 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 [2022-11-03 02:48:36,077 INFO L390 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 [2022-11-03 02:48:36,110 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:48:36,110 INFO L390 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 [2022-11-03 02:48:36,136 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:48:36,136 INFO L390 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 [2022-11-03 02:48:36,162 INFO L390 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 [2022-11-03 02:48:36,169 INFO L390 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 [2022-11-03 02:48:36,176 INFO L390 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 [2022-11-03 02:48:36,273 INFO L390 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 [2022-11-03 02:48:36,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:36,314 INFO L390 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 [2022-11-03 02:48:36,350 INFO L390 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 [2022-11-03 02:48:36,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:36,494 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:48:36,494 INFO L390 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 [2022-11-03 02:48:36,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:36,519 INFO L390 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 [2022-11-03 02:48:36,556 INFO L390 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 [2022-11-03 02:48:36,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:36,657 INFO L390 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 [2022-11-03 02:48:36,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:36,734 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:48:36,734 INFO L390 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 [2022-11-03 02:48:36,781 INFO L390 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 [2022-11-03 02:48:36,886 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:48:39,836 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4233#(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 [2022-11-03 02:48:39,836 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:48:39,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:48:39,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 12 [2022-11-03 02:48:39,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723250986] [2022-11-03 02:48:39,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:48:39,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:48:39,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:48:39,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:48:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=385, Unknown=4, NotChecked=172, Total=650 [2022-11-03 02:48:39,839 INFO L87 Difference]: Start difference. First operand 167 states and 213 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 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) [2022-11-03 02:48:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:48:40,238 INFO L93 Difference]: Finished difference Result 184 states and 228 transitions. [2022-11-03 02:48:40,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:48:40,238 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 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 [2022-11-03 02:48:40,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:48:40,240 INFO L225 Difference]: With dead ends: 184 [2022-11-03 02:48:40,240 INFO L226 Difference]: Without dead ends: 184 [2022-11-03 02:48:40,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=98, Invalid=420, Unknown=4, NotChecked=180, Total=702 [2022-11-03 02:48:40,241 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 144 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 455 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:48:40,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 161 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 277 Invalid, 0 Unknown, 455 Unchecked, 0.3s Time] [2022-11-03 02:48:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-03 02:48:40,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2022-11-03 02:48:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 124 states have (on average 1.5241935483870968) internal successors, (189), 153 states have internal predecessors, (189), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 02:48:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 203 transitions. [2022-11-03 02:48:40,246 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 203 transitions. Word has length 22 [2022-11-03 02:48:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:48:40,247 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 203 transitions. [2022-11-03 02:48:40,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 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) [2022-11-03 02:48:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 203 transitions. [2022-11-03 02:48:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:48:40,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:48:40,248 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:48:40,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-03 02:48:40,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 02:48:40,449 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:48:40,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:48:40,449 INFO L85 PathProgramCache]: Analyzing trace with hash -159940653, now seen corresponding path program 1 times [2022-11-03 02:48:40,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:48:40,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588020207] [2022-11-03 02:48:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:48:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:48:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:48:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:48:41,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:48:41,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588020207] [2022-11-03 02:48:41,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588020207] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:48:41,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030428670] [2022-11-03 02:48:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:48:41,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:48:41,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:48:41,228 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:48:41,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:48:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:48:41,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 02:48:41,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:48:41,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:41,581 INFO L390 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 [2022-11-03 02:48:41,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:41,591 INFO L390 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 [2022-11-03 02:48:41,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:41,711 INFO L390 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 [2022-11-03 02:48:41,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:41,718 INFO L390 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 [2022-11-03 02:48:41,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:41,864 INFO L390 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 [2022-11-03 02:48:41,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:41,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:41,892 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:48:41,893 INFO L390 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 26 treesize of output 28 [2022-11-03 02:48:41,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:41,983 INFO L390 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 [2022-11-03 02:48:41,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:41,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:42,004 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:48:42,004 INFO L390 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 [2022-11-03 02:48:42,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:42,052 INFO L390 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 [2022-11-03 02:48:42,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:42,062 INFO L390 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 [2022-11-03 02:48:42,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:42,099 INFO L390 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 [2022-11-03 02:48:42,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:42,104 INFO L390 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 [2022-11-03 02:48:42,135 INFO L390 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 [2022-11-03 02:48:42,139 INFO L390 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 [2022-11-03 02:48:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:48:42,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:48:42,157 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_579) |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$.base| |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 [2022-11-03 02:48:42,165 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |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_579 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-11-03 02:48:42,186 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (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|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (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_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-11-03 02:48:42,213 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |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|))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (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|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))) is different from false [2022-11-03 02:48:42,236 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (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|)))) (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|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (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_54| v_ArrVal_571) |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 [2022-11-03 02:48:42,292 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (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))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |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 [2022-11-03 02:48:42,368 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (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))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (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_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |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 [2022-11-03 02:48:44,450 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |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)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 0))))) (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))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:48:44,628 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 0))))) (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_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_579) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)))))))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |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)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|))))))) is different from false [2022-11-03 02:48:44,717 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (forall ((v_ArrVal_579 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 0))))) (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_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_579) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |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)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|))))))) is different from false [2022-11-03 02:48:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-03 02:48:44,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030428670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:48:44,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1054083170] [2022-11-03 02:48:44,925 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 02:48:44,925 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:48:44,925 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:48:44,926 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:48:44,926 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:48:44,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:44,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:44,942 INFO L390 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 [2022-11-03 02:48:44,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:45,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:45,005 INFO L390 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 [2022-11-03 02:48:45,009 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-11-03 02:48:45,710 INFO L390 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 [2022-11-03 02:48:45,719 INFO L390 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 [2022-11-03 02:48:45,727 INFO L390 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 [2022-11-03 02:48:45,760 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:48:45,760 INFO L390 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 [2022-11-03 02:48:45,770 INFO L390 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 [2022-11-03 02:48:45,793 INFO L390 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 [2022-11-03 02:48:45,801 INFO L390 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 [2022-11-03 02:48:45,807 INFO L390 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 [2022-11-03 02:48:45,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:45,955 INFO L390 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 [2022-11-03 02:48:45,977 INFO L390 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 [2022-11-03 02:48:46,018 INFO L390 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 [2022-11-03 02:48:46,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:46,113 INFO L390 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 [2022-11-03 02:48:46,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:46,189 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:48:46,190 INFO L390 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 [2022-11-03 02:48:46,223 INFO L390 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 [2022-11-03 02:48:46,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:46,332 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:48:46,333 INFO L390 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 [2022-11-03 02:48:46,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:48:46,398 INFO L390 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 [2022-11-03 02:48:46,421 INFO L390 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 [2022-11-03 02:48:46,726 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:48:51,255 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4769#(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 [2022-11-03 02:48:51,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:48:51,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:48:51,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 13] total 32 [2022-11-03 02:48:51,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231481858] [2022-11-03 02:48:51,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:48:51,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 02:48:51,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:48:51,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 02:48:51,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1157, Unknown=10, NotChecked=790, Total=2162 [2022-11-03 02:48:51,258 INFO L87 Difference]: Start difference. First operand 161 states and 203 transitions. Second operand has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 29 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) [2022-11-03 02:48:51,285 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 0)) (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (forall ((v_ArrVal_579 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 0))))) (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_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_579) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |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)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|))))))) is different from false [2022-11-03 02:48:53,293 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_sll_append_#in~head#1.offset| 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 0))))) (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_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_579) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)))))))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |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)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0) (not (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 0)) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) is different from false [2022-11-03 02:48:55,343 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |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)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)))) (< |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_56| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 0))))) (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))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:48:55,422 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (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))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (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_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |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_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:48:57,431 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (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))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |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_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:48:59,435 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |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_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (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|)))) (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|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (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_54| v_ArrVal_571) |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 [2022-11-03 02:49:01,448 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~head~0#1.offset|) 0) (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |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|))))) (< |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_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (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|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:49:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:02,101 INFO L93 Difference]: Finished difference Result 195 states and 242 transitions. [2022-11-03 02:49:02,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 02:49:02,102 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 29 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 [2022-11-03 02:49:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:02,103 INFO L225 Difference]: With dead ends: 195 [2022-11-03 02:49:02,103 INFO L226 Difference]: Without dead ends: 195 [2022-11-03 02:49:02,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=264, Invalid=1593, Unknown=17, NotChecked=1666, Total=3540 [2022-11-03 02:49:02,104 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 8 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 391 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:02,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1283 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 306 Invalid, 0 Unknown, 391 Unchecked, 0.3s Time] [2022-11-03 02:49:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-03 02:49:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2022-11-03 02:49:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 143 states have (on average 1.4615384615384615) internal successors, (209), 172 states have internal predecessors, (209), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-03 02:49:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 225 transitions. [2022-11-03 02:49:02,112 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 225 transitions. Word has length 24 [2022-11-03 02:49:02,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:02,112 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 225 transitions. [2022-11-03 02:49:02,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 29 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) [2022-11-03 02:49:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 225 transitions. [2022-11-03 02:49:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 02:49:02,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:02,114 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:49:02,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:02,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:49:02,337 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:49:02,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:02,337 INFO L85 PathProgramCache]: Analyzing trace with hash 397888227, now seen corresponding path program 1 times [2022-11-03 02:49:02,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:49:02,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092368695] [2022-11-03 02:49:02,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:02,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:49:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:49:02,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:49:02,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092368695] [2022-11-03 02:49:02,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092368695] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:49:02,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223218457] [2022-11-03 02:49:02,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:02,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:49:02,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:49:02,491 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:49:02,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:49:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:02,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:49:02,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:49:02,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:49:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:49:02,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223218457] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:49:02,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [966181117] [2022-11-03 02:49:02,768 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 02:49:02,768 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:49:02,768 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:49:02,768 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:49:02,769 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:49:02,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:02,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:02,791 INFO L390 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 [2022-11-03 02:49:02,984 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-03 02:49:03,412 INFO L390 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 [2022-11-03 02:49:03,420 INFO L390 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 [2022-11-03 02:49:03,428 INFO L390 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 [2022-11-03 02:49:03,463 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:49:03,463 INFO L390 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 [2022-11-03 02:49:03,494 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:49:03,494 INFO L390 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 [2022-11-03 02:49:03,521 INFO L390 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 [2022-11-03 02:49:03,528 INFO L390 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 [2022-11-03 02:49:03,536 INFO L390 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 [2022-11-03 02:49:03,633 INFO L390 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 [2022-11-03 02:49:03,664 INFO L390 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 [2022-11-03 02:49:03,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:03,683 INFO L390 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 [2022-11-03 02:49:03,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:03,782 INFO L390 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 [2022-11-03 02:49:03,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:03,818 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:49:03,819 INFO L390 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 [2022-11-03 02:49:03,860 INFO L390 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 [2022-11-03 02:49:03,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:03,955 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:49:03,955 INFO L390 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 [2022-11-03 02:49:03,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:03,980 INFO L390 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 [2022-11-03 02:49:04,032 INFO L390 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 [2022-11-03 02:49:04,103 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:49:06,495 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5349#(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|) (<= |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) (<= |#NULL.offset| 0) (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|) (<= 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|) (<= |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|) (= (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 [2022-11-03 02:49:06,495 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:49:06,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:49:06,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-11-03 02:49:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149473671] [2022-11-03 02:49:06,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:49:06,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:49:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:49:06,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:49:06,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:49:06,497 INFO L87 Difference]: Start difference. First operand 181 states and 225 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 9 states have internal predecessors, (35), 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) [2022-11-03 02:49:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:06,769 INFO L93 Difference]: Finished difference Result 222 states and 267 transitions. [2022-11-03 02:49:06,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:49:06,770 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 9 states have internal predecessors, (35), 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 26 [2022-11-03 02:49:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:06,771 INFO L225 Difference]: With dead ends: 222 [2022-11-03 02:49:06,771 INFO L226 Difference]: Without dead ends: 222 [2022-11-03 02:49:06,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2022-11-03 02:49:06,772 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 153 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:06,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 505 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:49:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-03 02:49:06,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2022-11-03 02:49:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.4367816091954022) internal successors, (250), 203 states have internal predecessors, (250), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 02:49:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 264 transitions. [2022-11-03 02:49:06,780 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 264 transitions. Word has length 26 [2022-11-03 02:49:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:06,780 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 264 transitions. [2022-11-03 02:49:06,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 9 states have internal predecessors, (35), 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) [2022-11-03 02:49:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 264 transitions. [2022-11-03 02:49:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:49:06,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:06,782 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:49:06,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:07,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 02:49:07,009 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:49:07,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash -267842461, now seen corresponding path program 1 times [2022-11-03 02:49:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:49:07,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757919556] [2022-11-03 02:49:07,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:07,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:49:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:07,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:49:07,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757919556] [2022-11-03 02:49:07,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757919556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:49:07,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073998555] [2022-11-03 02:49:07,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:07,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:49:07,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:49:07,221 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:49:07,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:49:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:07,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 02:49:07,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:07,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:49:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:49:07,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073998555] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:49:07,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1102490225] [2022-11-03 02:49:07,523 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-03 02:49:07,523 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:49:07,523 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:49:07,523 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:49:07,524 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:49:07,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:07,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:07,559 INFO L390 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 [2022-11-03 02:49:07,725 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 32 for LOIs [2022-11-03 02:49:08,138 INFO L390 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 [2022-11-03 02:49:08,146 INFO L390 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 [2022-11-03 02:49:08,152 INFO L390 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 [2022-11-03 02:49:08,187 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:49:08,188 INFO L390 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 [2022-11-03 02:49:08,217 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:49:08,218 INFO L390 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 [2022-11-03 02:49:08,243 INFO L390 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 [2022-11-03 02:49:08,251 INFO L390 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 [2022-11-03 02:49:08,262 INFO L390 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 [2022-11-03 02:49:08,359 INFO L390 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 [2022-11-03 02:49:08,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:08,395 INFO L390 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 [2022-11-03 02:49:08,423 INFO L390 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 [2022-11-03 02:49:08,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:08,514 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:49:08,515 INFO L390 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 [2022-11-03 02:49:08,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:08,544 INFO L390 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 [2022-11-03 02:49:08,584 INFO L390 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 [2022-11-03 02:49:08,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:08,657 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:49:08,658 INFO L390 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 [2022-11-03 02:49:08,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:08,700 INFO L390 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 [2022-11-03 02:49:08,746 INFO L390 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 [2022-11-03 02:49:08,947 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:49:12,511 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5978#(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 [2022-11-03 02:49:12,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:49:12,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:49:12,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2022-11-03 02:49:12,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958618314] [2022-11-03 02:49:12,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:49:12,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:49:12,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:49:12,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:49:12,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:49:12,514 INFO L87 Difference]: Start difference. First operand 213 states and 264 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) [2022-11-03 02:49:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:49:12,934 INFO L93 Difference]: Finished difference Result 274 states and 325 transitions. [2022-11-03 02:49:12,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:49:12,935 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 [2022-11-03 02:49:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:49:12,936 INFO L225 Difference]: With dead ends: 274 [2022-11-03 02:49:12,936 INFO L226 Difference]: Without dead ends: 274 [2022-11-03 02:49:12,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-11-03 02:49:12,937 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 173 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:49:12,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 677 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:49:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-03 02:49:12,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 233. [2022-11-03 02:49:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.458762886597938) internal successors, (283), 223 states have internal predecessors, (283), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 02:49:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 297 transitions. [2022-11-03 02:49:12,945 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 297 transitions. Word has length 28 [2022-11-03 02:49:12,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:49:12,945 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 297 transitions. [2022-11-03 02:49:12,946 INFO L496 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) [2022-11-03 02:49:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 297 transitions. [2022-11-03 02:49:12,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:49:12,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:49:12,947 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:49:12,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:49:13,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 02:49:13,161 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:49:13,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:49:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1718646116, now seen corresponding path program 2 times [2022-11-03 02:49:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:49:13,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073966197] [2022-11-03 02:49:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:49:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:49:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:49:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:49:13,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:49:13,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073966197] [2022-11-03 02:49:13,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073966197] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:49:13,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099587231] [2022-11-03 02:49:13,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:49:13,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:49:13,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:49:13,927 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:49:13,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:49:14,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 02:49:14,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:49:14,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 02:49:14,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:49:14,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,441 INFO L390 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 [2022-11-03 02:49:14,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,447 INFO L390 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 [2022-11-03 02:49:14,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,591 INFO L390 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 [2022-11-03 02:49:14,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,599 INFO L390 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 [2022-11-03 02:49:14,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,790 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:49:14,790 INFO L390 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 [2022-11-03 02:49:14,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,800 INFO L390 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 [2022-11-03 02:49:14,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:49:14,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,891 INFO L390 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 [2022-11-03 02:49:14,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,898 INFO L390 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 [2022-11-03 02:49:14,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,944 INFO L390 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 [2022-11-03 02:49:14,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,950 INFO L390 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 [2022-11-03 02:49:14,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,968 INFO L390 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 [2022-11-03 02:49:14,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:14,973 INFO L390 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 [2022-11-03 02:49:15,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:15,017 INFO L390 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 [2022-11-03 02:49:15,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:15,024 INFO L390 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 [2022-11-03 02:49:15,061 INFO L390 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 [2022-11-03 02:49:15,066 INFO L390 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 [2022-11-03 02:49:15,072 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:49:15,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:49:15,086 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_854 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_854) |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$.base| |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 [2022-11-03 02:49:15,108 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_~new_last~0#1.base_16| Int)) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_851 (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_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|))) (forall ((|v_sll_append_~new_last~0#1.base_16| Int)) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (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_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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 [2022-11-03 02:49:15,165 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (v_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |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_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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|))) (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (v_ArrVal_848 (Array Int Int))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_848) |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 [2022-11-03 02:49:17,214 WARN L833 $PredicateComparison]: unable to prove that (and (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_ArrVal_848 (Array Int Int))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_74| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (v_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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 [2022-11-03 02:49:17,257 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_845 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (v_ArrVal_848 (Array Int Int))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_851 (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_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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|))))) (forall ((v_ArrVal_846 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (v_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (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_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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 [2022-11-03 02:49:19,343 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_845 (Array Int Int)) (|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_ArrVal_848 (Array Int Int))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_846 (Array Int Int)) (|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_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|))))))) is different from false [2022-11-03 02:49:25,543 WARN L234 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:49:25,727 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (not (<= 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|)) (not (<= |v_sll_append_sll_create_~new_head~0#1.offset_70| 0)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_846 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (v_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= 0 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_76| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_76|) |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_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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|))))))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int)) (or (forall ((v_ArrVal_843 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_843) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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) (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:49:25,825 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_840 (Array Int Int))) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_846 (Array Int Int)) (|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_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= 0 (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_840))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76|) |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_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))) (not (<= 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|)) (not (<= |v_sll_append_sll_create_~new_head~0#1.offset_70| 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_841 (Array Int Int))) (or (forall ((v_ArrVal_843 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_841) |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_843) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:49:26,014 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_77| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_77| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_840 (Array Int Int))) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (not (<= 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (forall ((v_ArrVal_846 (Array Int Int)) (|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_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (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_77| v_ArrVal_840))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76|) |v_sll_append_sll_create_~new_head~0#1.offset_70| 0))) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)))) (not (<= |v_sll_append_sll_create_~new_head~0#1.offset_70| 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_77| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_77| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_841 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_843 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_77| v_ArrVal_841) |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_843) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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 [2022-11-03 02:49:26,411 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_77| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_77| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_840 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (not (<= 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_846 (Array Int Int)) (|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_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (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_77| v_ArrVal_840))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76|) |v_sll_append_sll_create_~new_head~0#1.offset_70| 0))) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |v_sll_append_~new_last~0#1.base_16|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))) (not (<= |v_sll_append_sll_create_~new_head~0#1.offset_70| 0)))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_77| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_841 (Array Int Int))) (or (forall ((v_ArrVal_843 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_77| v_ArrVal_841) |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_843) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |v_sll_append_~new_last~0#1.base_16|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_77| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:49:26,615 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_77| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_77| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_840 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (not (<= 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|)) (not (<= |v_sll_append_sll_create_~new_head~0#1.offset_70| 0)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_846 (Array Int Int)) (|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_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (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_77| v_ArrVal_840))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76|) |v_sll_append_sll_create_~new_head~0#1.offset_70| 0))) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |v_sll_append_~new_last~0#1.base_16|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_77| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_77| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_841 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_843 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_77| v_ArrVal_841) |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_843) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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_node_create_with_sublist_~new_node~0#1.base_28| |v_sll_append_~new_last~0#1.base_16|))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:49:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 22 not checked. [2022-11-03 02:49:27,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099587231] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:49:27,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2126337096] [2022-11-03 02:49:27,616 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-03 02:49:27,617 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:49:27,617 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:49:27,617 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:49:27,617 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:49:27,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:27,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:27,631 INFO L390 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 [2022-11-03 02:49:27,773 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 32 for LOIs [2022-11-03 02:49:28,158 INFO L390 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 [2022-11-03 02:49:28,165 INFO L390 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 [2022-11-03 02:49:28,171 INFO L390 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 [2022-11-03 02:49:28,200 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:49:28,201 INFO L390 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 [2022-11-03 02:49:28,228 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:49:28,229 INFO L390 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 [2022-11-03 02:49:28,256 INFO L390 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 [2022-11-03 02:49:28,265 INFO L390 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 [2022-11-03 02:49:28,273 INFO L390 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 [2022-11-03 02:49:28,357 INFO L390 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 [2022-11-03 02:49:28,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:28,390 INFO L390 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 [2022-11-03 02:49:28,416 INFO L390 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 [2022-11-03 02:49:28,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:28,498 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:49:28,498 INFO L390 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 [2022-11-03 02:49:28,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:28,520 INFO L390 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 [2022-11-03 02:49:28,551 INFO L390 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 [2022-11-03 02:49:28,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:28,652 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:49:28,652 INFO L390 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 [2022-11-03 02:49:28,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:49:28,697 INFO L390 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 [2022-11-03 02:49:28,735 INFO L390 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 [2022-11-03 02:49:28,898 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:49:32,938 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6724#(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 [2022-11-03 02:49:32,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:49:32,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:49:32,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 15] total 34 [2022-11-03 02:49:32,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269627563] [2022-11-03 02:49:32,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:49:32,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 02:49:32,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:49:32,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 02:49:32,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1241, Unknown=11, NotChecked=902, Total=2352 [2022-11-03 02:49:32,941 INFO L87 Difference]: Start difference. First operand 233 states and 297 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) [2022-11-03 02:49:32,980 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#head~1#1.offset| 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_77| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_77| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_840 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (not (<= 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|)) (not (<= |v_sll_append_sll_create_~new_head~0#1.offset_70| 0)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_846 (Array Int Int)) (|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_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (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_77| v_ArrVal_840))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76|) |v_sll_append_sll_create_~new_head~0#1.offset_70| 0))) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |v_sll_append_~new_last~0#1.base_16|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |c_#StackHeapBarrier|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#head~1#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_77| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_77| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_841 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_843 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_77| v_ArrVal_841) |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_843) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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_node_create_with_sublist_~new_node~0#1.base_28| |v_sll_append_~new_last~0#1.base_16|))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |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|)) is different from false [2022-11-03 02:49:34,988 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|))) (and (= |c_sll_append_#in~head#1.offset| 0) (= (select .cse0 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select .cse1 |c_sll_append_#in~head#1.offset|) 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_77| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_77| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_840 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (not (<= 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_846 (Array Int Int)) (|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_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_77| v_ArrVal_840))) (store .cse2 |v_sll_append_sll_create_~new_head~0#1.base_76| (store (select .cse2 |v_sll_append_sll_create_~new_head~0#1.base_76|) |v_sll_append_sll_create_~new_head~0#1.offset_70| 0))) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |v_sll_append_~new_last~0#1.base_16|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))) (not (<= |v_sll_append_sll_create_~new_head~0#1.offset_70| 0)))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_77| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_841 (Array Int Int))) (or (forall ((v_ArrVal_843 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_77| v_ArrVal_841) |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_843) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |v_sll_append_~new_last~0#1.base_16|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_77| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_28| |c_#StackHeapBarrier|)))) (= (select .cse1 0) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (= (select .cse0 |c_sll_append_#in~head#1.offset|) 0))) is different from false [2022-11-03 02:49:35,003 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |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_77| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_77| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_840 (Array Int Int))) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (not (<= 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (forall ((v_ArrVal_846 (Array Int Int)) (|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_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (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_77| v_ArrVal_840))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76|) |v_sll_append_sll_create_~new_head~0#1.offset_70| 0))) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)))) (not (<= |v_sll_append_sll_create_~new_head~0#1.offset_70| 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_77| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_77| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_841 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_843 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_77| v_ArrVal_841) |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_843) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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|))))))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:49:35,012 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |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_76| Int) (v_ArrVal_840 (Array Int Int))) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_846 (Array Int Int)) (|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_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= 0 (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_840))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_76|) |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_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))) (not (<= 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|)) (not (<= |v_sll_append_sll_create_~new_head~0#1.offset_70| 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int) (v_ArrVal_841 (Array Int Int))) (or (forall ((v_ArrVal_843 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_841) |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_843) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:49:37,019 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_76| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.offset_70| Int)) (or (not (<= 0 |v_sll_append_sll_create_~new_head~0#1.offset_70|)) (not (<= |v_sll_append_sll_create_~new_head~0#1.offset_70| 0)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_846 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (v_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= 0 (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_76| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_76|) |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_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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|))))))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.base| |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_76| Int)) (or (forall ((v_ArrVal_843 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_75| Int) (v_ArrVal_853 (Array Int Int)) (v_ArrVal_845 (Array Int Int)) (|v_sll_append_~new_last~0#1.base_16| Int) (|v_sll_append_sll_create_~new_head~0#1.base_74| Int) (v_ArrVal_848 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_76| v_ArrVal_843) |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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) (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_16|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_76| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:49:39,046 WARN L833 $PredicateComparison]: unable to prove that (and (= (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_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_845 (Array Int Int)) (|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_ArrVal_848 (Array Int Int))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 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|) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (= (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))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |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_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_846 (Array Int Int)) (|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_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:49:44,762 WARN L833 $PredicateComparison]: unable to prove that (and (= (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_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_845 (Array Int Int)) (|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_ArrVal_848 (Array Int Int))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 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|) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (= (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))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |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_74| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (v_ArrVal_848 (Array Int Int))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))) (<= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_846 (Array Int Int)) (|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_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_74| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (v_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:49:50,457 WARN L833 $PredicateComparison]: unable to prove that (and (= (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_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_845 (Array Int Int)) (|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_ArrVal_848 (Array Int Int))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_845) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_~new_last~0#1.base_16| Int)) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_851 (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_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|))) (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|) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (= (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))) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((|v_sll_append_~new_last~0#1.base_16| Int)) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (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_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (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_ArrVal_848 (Array Int Int))) (or (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_851 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_848) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))) (<= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_75| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_75| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_846 (Array Int Int)) (|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_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_75| v_ArrVal_846) |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)))))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_74| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_74| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_~new_last~0#1.base_16| Int) (v_ArrVal_847 (Array Int Int))) (or (forall ((v_ArrVal_854 (Array Int Int)) (v_ArrVal_852 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_74| v_ArrVal_847) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_852) |v_sll_append_~new_last~0#1.base_16| v_ArrVal_854) |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_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:50:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:20,820 INFO L93 Difference]: Finished difference Result 238 states and 296 transitions. [2022-11-03 02:50:20,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:50:20,821 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 [2022-11-03 02:50:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:20,822 INFO L225 Difference]: With dead ends: 238 [2022-11-03 02:50:20,822 INFO L226 Difference]: Without dead ends: 238 [2022-11-03 02:50:20,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 19 IntricatePredicates, 1 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 62.4s TimeCoverageRelationStatistics Valid=268, Invalid=1511, Unknown=19, NotChecked=1862, Total=3660 [2022-11-03 02:50:20,824 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 503 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:20,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1174 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 346 Invalid, 0 Unknown, 503 Unchecked, 0.3s Time] [2022-11-03 02:50:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-03 02:50:20,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 229. [2022-11-03 02:50:20,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 190 states have (on average 1.4263157894736842) internal successors, (271), 219 states have internal predecessors, (271), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 02:50:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 285 transitions. [2022-11-03 02:50:20,832 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 285 transitions. Word has length 31 [2022-11-03 02:50:20,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:20,833 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 285 transitions. [2022-11-03 02:50:20,833 INFO L496 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) [2022-11-03 02:50:20,833 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 285 transitions. [2022-11-03 02:50:20,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 02:50:20,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:20,834 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:20,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:50:21,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 02:50:21,049 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:50:21,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1906821693, now seen corresponding path program 2 times [2022-11-03 02:50:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:21,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590786208] [2022-11-03 02:50:21,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:21,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-03 02:50:21,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:21,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590786208] [2022-11-03 02:50:21,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590786208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:50:21,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357038068] [2022-11-03 02:50:21,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:50:21,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:50:21,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:50:21,418 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:50:21,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:50:21,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:50:21,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:50:21,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 02:50:21,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:50:21,617 INFO L390 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 [2022-11-03 02:50:21,698 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:50:21,699 INFO L390 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 [2022-11-03 02:50:21,757 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:50:21,757 INFO L390 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 [2022-11-03 02:50:21,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:21,837 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 02:50:21,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 02:50:21,867 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:50:21,868 INFO L390 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 [2022-11-03 02:50:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:50:21,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:50:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:50:22,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357038068] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:50:22,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1472363963] [2022-11-03 02:50:22,459 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 02:50:22,460 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:50:22,460 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:50:22,460 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:50:22,460 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:50:22,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:22,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:22,479 INFO L390 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 [2022-11-03 02:50:22,663 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-03 02:50:23,042 INFO L390 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 [2022-11-03 02:50:23,050 INFO L390 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 [2022-11-03 02:50:23,066 INFO L390 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 [2022-11-03 02:50:23,095 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:50:23,095 INFO L390 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 [2022-11-03 02:50:23,126 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:50:23,126 INFO L390 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 [2022-11-03 02:50:23,162 INFO L390 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 [2022-11-03 02:50:23,171 INFO L390 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 [2022-11-03 02:50:23,179 INFO L390 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 [2022-11-03 02:50:23,261 INFO L390 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 [2022-11-03 02:50:23,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:23,293 INFO L390 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 [2022-11-03 02:50:23,307 INFO L390 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 [2022-11-03 02:50:23,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:23,383 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:50:23,384 INFO L390 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 [2022-11-03 02:50:23,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:23,433 INFO L390 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 [2022-11-03 02:50:23,452 INFO L390 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 [2022-11-03 02:50:23,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:23,530 INFO L390 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 [2022-11-03 02:50:23,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:23,587 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:50:23,587 INFO L390 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 [2022-11-03 02:50:23,612 INFO L390 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 [2022-11-03 02:50:23,693 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:50:26,238 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7436#(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 [2022-11-03 02:50:26,238 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:50:26,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:50:26,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 16 [2022-11-03 02:50:26,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074329913] [2022-11-03 02:50:26,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:50:26,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 02:50:26,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:26,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 02:50:26,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2022-11-03 02:50:26,240 INFO L87 Difference]: Start difference. First operand 229 states and 285 transitions. Second operand has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 15 states have internal predecessors, (55), 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) [2022-11-03 02:50:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:26,533 INFO L93 Difference]: Finished difference Result 261 states and 320 transitions. [2022-11-03 02:50:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:50:26,534 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 15 states have internal predecessors, (55), 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 32 [2022-11-03 02:50:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:26,535 INFO L225 Difference]: With dead ends: 261 [2022-11-03 02:50:26,536 INFO L226 Difference]: Without dead ends: 261 [2022-11-03 02:50:26,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2022-11-03 02:50:26,537 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 63 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:26,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 410 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 137 Unchecked, 0.2s Time] [2022-11-03 02:50:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-03 02:50:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 255. [2022-11-03 02:50:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 214 states have (on average 1.4205607476635513) internal successors, (304), 244 states have internal predecessors, (304), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 02:50:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 320 transitions. [2022-11-03 02:50:26,545 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 320 transitions. Word has length 32 [2022-11-03 02:50:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:26,545 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 320 transitions. [2022-11-03 02:50:26,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.235294117647059) internal successors, (55), 15 states have internal predecessors, (55), 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) [2022-11-03 02:50:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 320 transitions. [2022-11-03 02:50:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 02:50:26,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:26,546 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:26,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-03 02:50:26,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:50:26,760 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:50:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1495597889, now seen corresponding path program 1 times [2022-11-03 02:50:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:26,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751769787] [2022-11-03 02:50:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:50:27,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:27,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751769787] [2022-11-03 02:50:27,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751769787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:50:27,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674350461] [2022-11-03 02:50:27,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:27,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:50:27,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:50:27,397 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:50:27,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 02:50:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:27,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-03 02:50:27,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:50:27,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:27,897 INFO L390 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 [2022-11-03 02:50:27,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:27,905 INFO L390 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 [2022-11-03 02:50:28,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:28,021 INFO L390 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 [2022-11-03 02:50:28,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:28,031 INFO L390 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 [2022-11-03 02:50:28,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:28,202 INFO L390 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 [2022-11-03 02:50:28,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:28,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:28,238 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:50:28,238 INFO L390 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 26 treesize of output 28 [2022-11-03 02:50:28,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:28,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:28,355 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:50:28,355 INFO L390 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 [2022-11-03 02:50:28,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:28,376 INFO L390 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 [2022-11-03 02:50:28,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:28,413 INFO L390 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 [2022-11-03 02:50:28,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:28,418 INFO L390 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 [2022-11-03 02:50:28,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:28,466 INFO L390 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 [2022-11-03 02:50:28,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:28,471 INFO L390 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 [2022-11-03 02:50:28,501 INFO L390 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 [2022-11-03 02:50:28,503 INFO L390 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 [2022-11-03 02:50:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:50:28,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:50:28,521 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1057 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_1057) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_1056 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_1056) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-11-03 02:50:28,544 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (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_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (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_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |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_18|)))) is different from false [2022-11-03 02:50:28,589 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (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|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |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_18|))) (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1050) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |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_18|)))) is different from false [2022-11-03 02:50:30,637 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |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_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:50:32,671 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (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|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |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_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))) (forall ((v_ArrVal_1046 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (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_1046) |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:50:32,760 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1046 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_92| v_ArrVal_1046) |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_92| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_92|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |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_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|))))))) is different from false [2022-11-03 02:50:32,823 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1044 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1046 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (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_1044) |v_sll_append_sll_create_~new_head~0#1.base_92| v_ArrVal_1046) |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_1045 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1045))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |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_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:50:34,921 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_93| Int)) (or (forall ((v_ArrVal_1044 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1046 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_93| v_ArrVal_1044) |v_sll_append_sll_create_~new_head~0#1.base_92| v_ArrVal_1046) |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |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_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_93| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_93| Int)) (or (forall ((v_ArrVal_1045 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_93| v_ArrVal_1045))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_93| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:50:35,140 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_93| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_93| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1045 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_93| v_ArrVal_1045))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_93| Int)) (or (forall ((v_ArrVal_1044 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1046 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_93| v_ArrVal_1044) |v_sll_append_sll_create_~new_head~0#1.base_92| v_ArrVal_1046) |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |v_sll_append_~new_last~0#1.base_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_93| |c_#StackHeapBarrier|))))))) is different from false [2022-11-03 02:50:35,237 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_93| Int)) (or (forall ((v_ArrVal_1045 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_93| v_ArrVal_1045))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |v_sll_append_~new_last~0#1.base_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_93| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_93| Int)) (or (forall ((v_ArrVal_1044 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1046 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_93| v_ArrVal_1044) |v_sll_append_sll_create_~new_head~0#1.base_92| v_ArrVal_1046) |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_93| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |c_#StackHeapBarrier|))))) is different from false [2022-11-03 02:50:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 12 not checked. [2022-11-03 02:50:36,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674350461] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:50:36,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732349165] [2022-11-03 02:50:36,263 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-03 02:50:36,263 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:50:36,263 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:50:36,263 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:50:36,264 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:50:36,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:36,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:36,291 INFO L390 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 [2022-11-03 02:50:36,449 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-03 02:50:36,876 INFO L390 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 [2022-11-03 02:50:36,885 INFO L390 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 [2022-11-03 02:50:36,892 INFO L390 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 [2022-11-03 02:50:36,927 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:50:36,928 INFO L390 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 [2022-11-03 02:50:36,936 INFO L390 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 [2022-11-03 02:50:36,960 INFO L390 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 [2022-11-03 02:50:36,968 INFO L390 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 [2022-11-03 02:50:36,976 INFO L390 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 [2022-11-03 02:50:37,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:37,056 INFO L390 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 [2022-11-03 02:50:37,093 INFO L390 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 [2022-11-03 02:50:37,113 INFO L390 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 [2022-11-03 02:50:37,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:37,210 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:50:37,210 INFO L390 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 [2022-11-03 02:50:37,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:37,246 INFO L390 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 [2022-11-03 02:50:37,267 INFO L390 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 [2022-11-03 02:50:37,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:37,351 INFO L390 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 [2022-11-03 02:50:37,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:50:37,408 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:50:37,408 INFO L390 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 [2022-11-03 02:50:37,446 INFO L390 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 [2022-11-03 02:50:37,626 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:50:41,916 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8199#(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|)) (<= |#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_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_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 [2022-11-03 02:50:41,916 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:50:41,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:50:41,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 13] total 32 [2022-11-03 02:50:41,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020666524] [2022-11-03 02:50:41,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:50:41,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 02:50:41,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:41,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 02:50:41,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1246, Unknown=10, NotChecked=810, Total=2256 [2022-11-03 02:50:41,918 INFO L87 Difference]: Start difference. First operand 255 states and 320 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 29 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) [2022-11-03 02:50:41,956 WARN L833 $PredicateComparison]: unable to prove that (and (= |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$.base| |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_93| Int)) (or (forall ((v_ArrVal_1045 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_93| v_ArrVal_1045))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |v_sll_append_~new_last~0#1.base_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_93| |c_#StackHeapBarrier|)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#head~1#1.base|) 1) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_93| Int)) (or (forall ((v_ArrVal_1044 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1046 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_93| v_ArrVal_1044) |v_sll_append_sll_create_~new_head~0#1.base_92| v_ArrVal_1046) |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_93| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |c_#StackHeapBarrier|)))) (= (select (select |c_#memory_$Pointer$.offset| |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|)) is different from false [2022-11-03 02:50:43,995 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_sll_append_#in~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_sll_append_#in~head#1.base|))) (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_93| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_93| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1045 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= 0 (select (select (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_93| v_ArrVal_1045))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |c_#StackHeapBarrier|)))) (= |c_sll_append_#in~head#1.offset| 0) (= (select .cse2 0) 0) (<= (+ |c_#StackHeapBarrier| 1) |c_sll_append_#in~head#1.base|) (< |c_#StackHeapBarrier| |c_sll_append_#in~head#1.base|) (= (select .cse3 |c_sll_append_#in~head#1.offset|) 0) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_93| Int)) (or (forall ((v_ArrVal_1044 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1046 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_93| v_ArrVal_1044) |v_sll_append_sll_create_~new_head~0#1.base_92| v_ArrVal_1046) |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_30| |v_sll_append_~new_last~0#1.base_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_93| |c_#StackHeapBarrier|)))))) (= (select .cse3 0) 0) (= (select |c_#valid| |c_sll_append_#in~head#1.base|) 1) (= (select .cse2 |c_sll_append_#in~head#1.offset|) 0))) is different from false [2022-11-03 02:50:44,034 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_93| Int)) (or (forall ((v_ArrVal_1044 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1046 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_93| v_ArrVal_1044) |v_sll_append_sll_create_~new_head~0#1.base_92| v_ArrVal_1046) |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |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_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_93| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_93| Int)) (or (forall ((v_ArrVal_1045 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_93| v_ArrVal_1045))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_93| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:50:44,053 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1044 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1046 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (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_1044) |v_sll_append_sll_create_~new_head~0#1.base_92| v_ArrVal_1046) |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (< |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) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (forall ((v_ArrVal_1045 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_1045))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_92|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |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_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)))) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:50:46,081 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1046 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_92| v_ArrVal_1046) |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (< |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_92| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_92| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_92| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_92|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |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_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:50:48,093 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (< |c_sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (< |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_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (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|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 |c_sll_append_sll_create_~new_head~0#1.offset|))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |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_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))) (= |c_sll_append_sll_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_1046 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (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_1046) |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:50:50,107 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|sll_append_sll_create_~new_head~0#1.base| Int)) (and (= (select (select |c_#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~head~0#1.offset|) 0) (< |sll_append_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|))) (= (select (select |c_#memory_$Pointer$.offset| |c_sll_append_~head#1.base|) 0) 0) (= |c_sll_append_sll_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_sll_append_~head#1.base|) 0) 0) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int)) (or (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |v_sll_append_~new_last~0#1.base_18|) (forall ((v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1055 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_91| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_91|) 0 |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1055) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1056) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_91| Int)) (or (forall ((|v_sll_append_~new_last~0#1.base_18| Int) (v_ArrVal_1050 (Array Int Int))) (or (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_91| v_ArrVal_1050) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_1054) |v_sll_append_~new_last~0#1.base_18| v_ArrVal_1057) |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_18|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_91| |c_#StackHeapBarrier|)))) (< |c_sll_append_node_create_with_sublist_~new_node~0#1.base| |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_sll_append_~head#1.base|) (= |c_sll_append_~head#1.offset| 0)) is different from false [2022-11-03 02:52:36,370 WARN L234 SmtUtils]: Spent 46.09s on a formula simplification. DAG size of input: 57 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:53:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:08,981 INFO L93 Difference]: Finished difference Result 268 states and 327 transitions. [2022-11-03 02:53:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 02:53:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 29 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) Word has length 34 [2022-11-03 02:53:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:08,984 INFO L225 Difference]: With dead ends: 268 [2022-11-03 02:53:08,984 INFO L226 Difference]: Without dead ends: 268 [2022-11-03 02:53:08,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 157.6s TimeCoverageRelationStatistics Valid=261, Invalid=1739, Unknown=48, NotChecked=1734, Total=3782 [2022-11-03 02:53:08,986 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 22 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 672 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:08,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1069 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 370 Invalid, 0 Unknown, 672 Unchecked, 0.4s Time] [2022-11-03 02:53:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-03 02:53:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 251. [2022-11-03 02:53:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 210 states have (on average 1.3904761904761904) internal successors, (292), 240 states have internal predecessors, (292), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 02:53:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 308 transitions. [2022-11-03 02:53:08,997 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 308 transitions. Word has length 34 [2022-11-03 02:53:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:08,997 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 308 transitions. [2022-11-03 02:53:08,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 29 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) [2022-11-03 02:53:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 308 transitions. [2022-11-03 02:53:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 02:53:08,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:08,999 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:53:09,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:53:09,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:53:09,217 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:53:09,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1707604520, now seen corresponding path program 1 times [2022-11-03 02:53:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:09,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654460460] [2022-11-03 02:53:09,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 02:53:09,383 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:09,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654460460] [2022-11-03 02:53:09,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654460460] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:53:09,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131962071] [2022-11-03 02:53:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:09,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:53:09,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:53:09,385 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:53:09,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 02:53:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:09,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:53:09,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:53:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 02:53:09,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:53:09,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131962071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:09,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:53:09,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-11-03 02:53:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419409111] [2022-11-03 02:53:09,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:09,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:53:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:53:09,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:53:09,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:53:09,703 INFO L87 Difference]: Start difference. First operand 251 states and 308 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:53:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:09,850 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2022-11-03 02:53:09,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:53:09,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-11-03 02:53:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:09,853 INFO L225 Difference]: With dead ends: 297 [2022-11-03 02:53:09,853 INFO L226 Difference]: Without dead ends: 297 [2022-11-03 02:53:09,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:53:09,854 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 158 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:09,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 137 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:53:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-11-03 02:53:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 251. [2022-11-03 02:53:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 210 states have (on average 1.3904761904761904) internal successors, (292), 240 states have internal predecessors, (292), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-03 02:53:09,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 308 transitions. [2022-11-03 02:53:09,876 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 308 transitions. Word has length 40 [2022-11-03 02:53:09,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:09,876 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 308 transitions. [2022-11-03 02:53:09,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:53:09,876 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 308 transitions. [2022-11-03 02:53:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:53:09,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:09,878 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:53:09,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:53:10,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:53:10,093 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:53:10,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1391473257, now seen corresponding path program 1 times [2022-11-03 02:53:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:10,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92285036] [2022-11-03 02:53:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 02:53:10,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:10,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92285036] [2022-11-03 02:53:10,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92285036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:10,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:53:10,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:53:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433726107] [2022-11-03 02:53:10,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:10,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:53:10,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:53:10,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:53:10,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:53:10,394 INFO L87 Difference]: Start difference. First operand 251 states and 308 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:53:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:10,764 INFO L93 Difference]: Finished difference Result 388 states and 493 transitions. [2022-11-03 02:53:10,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:53:10,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-03 02:53:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:10,767 INFO L225 Difference]: With dead ends: 388 [2022-11-03 02:53:10,768 INFO L226 Difference]: Without dead ends: 388 [2022-11-03 02:53:10,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:53:10,769 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 143 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:10,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 342 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:53:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-11-03 02:53:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 277. [2022-11-03 02:53:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 235 states have (on average 1.4170212765957446) internal successors, (333), 265 states have internal predecessors, (333), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-03 02:53:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 350 transitions. [2022-11-03 02:53:10,789 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 350 transitions. Word has length 41 [2022-11-03 02:53:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:10,789 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 350 transitions. [2022-11-03 02:53:10,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:53:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 350 transitions. [2022-11-03 02:53:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:53:10,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:10,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:53:10,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 02:53:10,793 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:53:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1396133748, now seen corresponding path program 1 times [2022-11-03 02:53:10,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:10,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806124037] [2022-11-03 02:53:10,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 02:53:11,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:11,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806124037] [2022-11-03 02:53:11,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806124037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:11,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:53:11,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:53:11,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153085834] [2022-11-03 02:53:11,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:11,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:53:11,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:53:11,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:53:11,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:53:11,113 INFO L87 Difference]: Start difference. First operand 277 states and 350 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:53:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:11,588 INFO L93 Difference]: Finished difference Result 452 states and 573 transitions. [2022-11-03 02:53:11,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:53:11,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-03 02:53:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:11,591 INFO L225 Difference]: With dead ends: 452 [2022-11-03 02:53:11,591 INFO L226 Difference]: Without dead ends: 452 [2022-11-03 02:53:11,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:53:11,592 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 210 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:11,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 276 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:53:11,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-11-03 02:53:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 288. [2022-11-03 02:53:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 247 states have (on average 1.417004048582996) internal successors, (350), 276 states have internal predecessors, (350), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-03 02:53:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 367 transitions. [2022-11-03 02:53:11,605 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 367 transitions. Word has length 41 [2022-11-03 02:53:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:11,606 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 367 transitions. [2022-11-03 02:53:11,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:53:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 367 transitions. [2022-11-03 02:53:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:53:11,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:11,607 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:53:11,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 02:53:11,608 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:53:11,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:11,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1396133747, now seen corresponding path program 1 times [2022-11-03 02:53:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:11,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725998118] [2022-11-03 02:53:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 02:53:12,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:12,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725998118] [2022-11-03 02:53:12,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725998118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:12,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:53:12,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:53:12,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946671168] [2022-11-03 02:53:12,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:12,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:53:12,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:53:12,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:53:12,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:53:12,064 INFO L87 Difference]: Start difference. First operand 288 states and 367 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:53:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:12,543 INFO L93 Difference]: Finished difference Result 404 states and 520 transitions. [2022-11-03 02:53:12,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:53:12,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-11-03 02:53:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:12,546 INFO L225 Difference]: With dead ends: 404 [2022-11-03 02:53:12,547 INFO L226 Difference]: Without dead ends: 404 [2022-11-03 02:53:12,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:53:12,548 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 155 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:12,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 294 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:53:12,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-11-03 02:53:12,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 290. [2022-11-03 02:53:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 249 states have (on average 1.4056224899598393) internal successors, (350), 278 states have internal predecessors, (350), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-03 02:53:12,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 367 transitions. [2022-11-03 02:53:12,561 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 367 transitions. Word has length 41 [2022-11-03 02:53:12,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:12,561 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 367 transitions. [2022-11-03 02:53:12,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:53:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 367 transitions. [2022-11-03 02:53:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 02:53:12,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:12,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:53:12,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 02:53:12,563 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:53:12,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:12,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1654615867, now seen corresponding path program 1 times [2022-11-03 02:53:12,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:12,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27226414] [2022-11-03 02:53:12,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:12,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-03 02:53:13,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:13,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27226414] [2022-11-03 02:53:13,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27226414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:13,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:53:13,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 02:53:13,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025447344] [2022-11-03 02:53:13,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:13,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:53:13,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:53:13,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:53:13,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:53:13,865 INFO L87 Difference]: Start difference. First operand 290 states and 367 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:53:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:15,232 INFO L93 Difference]: Finished difference Result 519 states and 666 transitions. [2022-11-03 02:53:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 02:53:15,233 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-11-03 02:53:15,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:15,236 INFO L225 Difference]: With dead ends: 519 [2022-11-03 02:53:15,236 INFO L226 Difference]: Without dead ends: 519 [2022-11-03 02:53:15,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:53:15,237 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 400 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:15,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 549 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 02:53:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-11-03 02:53:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 318. [2022-11-03 02:53:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 277 states have (on average 1.4223826714801444) internal successors, (394), 305 states have internal predecessors, (394), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-03 02:53:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 411 transitions. [2022-11-03 02:53:15,259 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 411 transitions. Word has length 43 [2022-11-03 02:53:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:15,260 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 411 transitions. [2022-11-03 02:53:15,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:53:15,260 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 411 transitions. [2022-11-03 02:53:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 02:53:15,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:15,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:53:15,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 02:53:15,262 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:53:15,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:15,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1654615866, now seen corresponding path program 1 times [2022-11-03 02:53:15,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:15,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742545404] [2022-11-03 02:53:15,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:15,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:53:17,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:17,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742545404] [2022-11-03 02:53:17,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742545404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:53:17,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:53:17,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:53:17,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812772031] [2022-11-03 02:53:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:53:17,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:53:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:53:17,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:53:17,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:53:17,036 INFO L87 Difference]: Start difference. First operand 318 states and 411 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:53:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:53:18,648 INFO L93 Difference]: Finished difference Result 566 states and 715 transitions. [2022-11-03 02:53:18,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 02:53:18,649 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-11-03 02:53:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:53:18,651 INFO L225 Difference]: With dead ends: 566 [2022-11-03 02:53:18,651 INFO L226 Difference]: Without dead ends: 566 [2022-11-03 02:53:18,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2022-11-03 02:53:18,652 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 503 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:53:18,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 383 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 02:53:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-11-03 02:53:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 318. [2022-11-03 02:53:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 277 states have (on average 1.4151624548736461) internal successors, (392), 305 states have internal predecessors, (392), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-03 02:53:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 409 transitions. [2022-11-03 02:53:18,666 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 409 transitions. Word has length 43 [2022-11-03 02:53:18,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:53:18,667 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 409 transitions. [2022-11-03 02:53:18,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 02:53:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 409 transitions. [2022-11-03 02:53:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:53:18,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:53:18,668 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:53:18,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-03 02:53:18,669 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:53:18,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:53:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash -947831941, now seen corresponding path program 1 times [2022-11-03 02:53:18,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:53:18,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606766357] [2022-11-03 02:53:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:18,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:53:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:53:21,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:53:21,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606766357] [2022-11-03 02:53:21,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606766357] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:53:21,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986696454] [2022-11-03 02:53:21,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:53:21,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:53:21,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:53:21,289 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:53:21,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 02:53:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:53:21,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-03 02:53:21,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:53:21,556 INFO L390 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 [2022-11-03 02:53:21,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:53:22,292 INFO L390 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 11 treesize of output 7 [2022-11-03 02:53:22,587 INFO L390 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 [2022-11-03 02:53:22,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:22,602 INFO L390 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 66 treesize of output 57 [2022-11-03 02:53:22,775 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:53:22,776 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 68 [2022-11-03 02:53:22,798 INFO L390 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 [2022-11-03 02:53:22,920 INFO L390 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 [2022-11-03 02:53:22,946 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:53:22,946 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 68 [2022-11-03 02:53:23,291 INFO L356 Elim1Store]: treesize reduction 56, result has 45.1 percent of original size [2022-11-03 02:53:23,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 102 [2022-11-03 02:53:23,498 INFO L356 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-11-03 02:53:23,499 INFO L390 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 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-03 02:53:23,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:53:24,116 INFO L356 Elim1Store]: treesize reduction 513, result has 16.0 percent of original size [2022-11-03 02:53:24,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 544 treesize of output 557 [2022-11-03 02:53:24,784 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-03 02:53:24,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 34 [2022-11-03 02:53:25,061 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 02:53:25,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 175 treesize of output 57 [2022-11-03 02:53:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:53:25,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:53:26,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:26,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:53:26,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36724 treesize of output 35508 [2022-11-03 02:58:15,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986696454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:58:15,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [316780766] [2022-11-03 02:58:15,154 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2022-11-03 02:58:15,154 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:58:15,155 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:58:15,155 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:58:15,155 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:58:15,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:15,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:15,182 INFO L390 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 [2022-11-03 02:58:15,476 INFO L356 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-03 02:58:15,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-11-03 02:58:15,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:58:15,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2022-11-03 02:58:15,562 INFO L390 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 9 [2022-11-03 02:58:15,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-03 02:58:15,590 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:58:15,590 INFO L390 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 14 [2022-11-03 02:58:15,613 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:58:15,613 INFO L390 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 [2022-11-03 02:58:15,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-03 02:58:15,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-03 02:58:15,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-03 02:58:15,719 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 02:58:15,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-03 02:58:15,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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 [2022-11-03 02:58:15,779 INFO L390 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 [2022-11-03 02:58:15,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:58:15,801 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:58:15,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 199 [2022-11-03 02:58:15,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:58:15,826 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-03 02:58:15,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 235 [2022-11-03 02:58:15,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:15,916 INFO L356 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-11-03 02:58:15,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 236 treesize of output 238 [2022-11-03 02:58:15,992 INFO L356 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2022-11-03 02:58:15,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 239 treesize of output 259 [2022-11-03 02:58:16,054 INFO L390 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 [2022-11-03 02:58:16,060 INFO L390 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 [2022-11-03 02:58:16,065 INFO L390 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 [2022-11-03 02:58:16,089 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:58:16,089 INFO L390 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 [2022-11-03 02:58:16,096 INFO L390 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 [2022-11-03 02:58:16,109 INFO L390 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 [2022-11-03 02:58:16,115 INFO L390 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 [2022-11-03 02:58:16,120 INFO L390 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 [2022-11-03 02:58:16,147 INFO L390 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 [2022-11-03 02:58:16,159 INFO L390 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 [2022-11-03 02:58:16,195 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:58:16,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 123 [2022-11-03 02:58:16,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:16,277 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:58:16,278 INFO L390 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 2 case distinctions, treesize of input 223 treesize of output 233 [2022-11-03 02:58:16,344 INFO L390 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 [2022-11-03 02:58:16,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:16,356 INFO L390 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 [2022-11-03 02:58:16,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:16,426 INFO L356 Elim1Store]: treesize reduction 51, result has 12.1 percent of original size [2022-11-03 02:58:16,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 330 treesize of output 328 [2022-11-03 02:58:16,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:16,485 INFO L390 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 [2022-11-03 02:58:16,503 INFO L390 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 [2022-11-03 02:58:16,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:16,662 INFO L356 Elim1Store]: treesize reduction 142, result has 14.5 percent of original size [2022-11-03 02:58:16,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 337 treesize of output 338 [2022-11-03 02:58:16,728 INFO L390 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 [2022-11-03 02:58:16,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:16,810 INFO L356 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2022-11-03 02:58:16,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 65 [2022-11-03 02:58:17,226 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:58:17,238 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:58:17,345 INFO L356 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-03 02:58:17,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-11-03 02:58:17,403 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:58:17,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2022-11-03 02:58:17,601 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:58:17,603 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:58:17,784 INFO L356 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-11-03 02:58:17,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-11-03 02:58:17,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:58:17,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2022-11-03 02:58:17,850 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-11-03 02:58:18,223 INFO L390 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 [2022-11-03 02:58:18,229 INFO L390 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 [2022-11-03 02:58:18,237 INFO L390 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 [2022-11-03 02:58:18,273 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:58:18,273 INFO L390 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 [2022-11-03 02:58:18,283 INFO L390 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 [2022-11-03 02:58:18,307 INFO L390 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 [2022-11-03 02:58:18,316 INFO L390 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 [2022-11-03 02:58:18,324 INFO L390 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 [2022-11-03 02:58:18,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:18,421 INFO L390 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 [2022-11-03 02:58:18,456 INFO L390 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 [2022-11-03 02:58:18,484 INFO L390 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 [2022-11-03 02:58:18,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:18,579 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:58:18,579 INFO L390 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 [2022-11-03 02:58:18,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:18,614 INFO L390 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 [2022-11-03 02:58:18,648 INFO L390 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 [2022-11-03 02:58:18,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:18,731 INFO L390 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 [2022-11-03 02:58:18,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:18,767 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:58:18,767 INFO L390 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 [2022-11-03 02:58:18,814 INFO L390 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 [2022-11-03 02:58:19,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:19,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:58:19,030 INFO L356 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-11-03 02:58:19,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 43 [2022-11-03 02:58:19,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:19,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:58:19,087 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-03 02:58:19,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2022-11-03 02:58:19,132 INFO L390 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 [2022-11-03 02:58:19,213 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:58:25,812 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13585#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (<= 1 |ULTIMATE.start_sll_length_~len~0#1|) (not (= (select |#valid| |ULTIMATE.start_sll_length_~head#1.base|) 1)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (<= 3 |ULTIMATE.start_main_~i~0#1|) (= 3 |ULTIMATE.start_main_~min~0#1|) (or (not (= |ULTIMATE.start_sll_length_~head#1.offset| 0)) (not (= |ULTIMATE.start_sll_length_~head#1.base| 0))) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:58:25,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:58:25,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:58:25,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 34 [2022-11-03 02:58:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147410284] [2022-11-03 02:58:25,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:58:25,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:58:25,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:58:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:58:25,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3551, Unknown=0, NotChecked=0, Total=3782 [2022-11-03 02:58:25,815 INFO L87 Difference]: Start difference. First operand 318 states and 409 transitions. Second operand has 36 states, 35 states have (on average 2.0) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:58:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:58:26,673 INFO L93 Difference]: Finished difference Result 390 states and 504 transitions. [2022-11-03 02:58:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-03 02:58:26,674 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-11-03 02:58:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:58:26,675 INFO L225 Difference]: With dead ends: 390 [2022-11-03 02:58:26,675 INFO L226 Difference]: Without dead ends: 390 [2022-11-03 02:58:26,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=290, Invalid=4680, Unknown=0, NotChecked=0, Total=4970 [2022-11-03 02:58:26,677 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:58:26,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 540 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 82 Unchecked, 0.3s Time] [2022-11-03 02:58:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-03 02:58:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 326. [2022-11-03 02:58:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 285 states have (on average 1.4140350877192982) internal successors, (403), 313 states have internal predecessors, (403), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-03 02:58:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 420 transitions. [2022-11-03 02:58:26,696 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 420 transitions. Word has length 45 [2022-11-03 02:58:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:58:26,697 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 420 transitions. [2022-11-03 02:58:26,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.0) internal successors, (70), 32 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:58:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 420 transitions. [2022-11-03 02:58:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:58:26,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:58:26,698 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:58:26,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:58:26,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:58:26,913 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-03 02:58:26,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:58:26,913 INFO L85 PathProgramCache]: Analyzing trace with hash -947831940, now seen corresponding path program 1 times [2022-11-03 02:58:26,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:58:26,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419680496] [2022-11-03 02:58:26,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:58:26,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:58:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:58:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:58:29,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:58:29,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419680496] [2022-11-03 02:58:29,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419680496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:58:29,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373069894] [2022-11-03 02:58:29,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:58:29,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:58:29,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:58:29,740 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:58:29,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d19cf7b-c4f5-48c1-b2a8-4ca7eaa291fc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 02:58:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:58:29,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-03 02:58:29,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:58:29,978 INFO L390 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 [2022-11-03 02:58:30,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-03 02:58:30,506 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:58:30,506 INFO L390 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-03 02:58:30,679 INFO L390 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 [2022-11-03 02:58:30,703 INFO L390 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 11 treesize of output 7 [2022-11-03 02:58:30,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:30,944 INFO L390 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 49 treesize of output 40 [2022-11-03 02:58:30,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:30,965 INFO L390 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 27 treesize of output 26 [2022-11-03 02:58:31,111 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:58:31,111 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 60 [2022-11-03 02:58:31,131 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 02:58:31,131 INFO L390 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 2 case distinctions, treesize of input 30 treesize of output 40 [2022-11-03 02:58:31,305 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:58:31,305 INFO L390 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 60 [2022-11-03 02:58:31,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:31,317 INFO L390 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 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:58:31,905 INFO L356 Elim1Store]: treesize reduction 79, result has 42.8 percent of original size [2022-11-03 02:58:31,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 97 treesize of output 110 [2022-11-03 02:58:31,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:31,962 INFO L356 Elim1Store]: treesize reduction 84, result has 33.3 percent of original size [2022-11-03 02:58:31,962 INFO L390 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 41 treesize of output 58 [2022-11-03 02:58:32,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:32,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:32,583 INFO L356 Elim1Store]: treesize reduction 33, result has 32.7 percent of original size [2022-11-03 02:58:32,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 158 treesize of output 153 [2022-11-03 02:58:33,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:58:33,371 INFO L356 Elim1Store]: treesize reduction 83, result has 11.7 percent of original size [2022-11-03 02:58:33,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 263 treesize of output 135 [2022-11-03 02:58:33,405 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-11-03 02:58:33,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 42 [2022-11-03 02:58:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:58:33,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:58:35,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:58:35,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:58:35,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:58:35,681 INFO L390 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 1428 treesize of output 1424 [2022-11-03 02:58:35,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:58:35,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:58:35,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:58:35,719 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:58:35,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 1138 treesize of output 1