./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- 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-02 20:40:31,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:40:31,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:40:31,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:40:31,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:40:31,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:40:31,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:40:31,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:40:31,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:40:31,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:40:31,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:40:31,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:40:31,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:40:31,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:40:31,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:40:31,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:40:31,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:40:31,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:40:31,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:40:31,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:40:31,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:40:31,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:40:31,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:40:31,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:40:31,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:40:31,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:40:31,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:40:31,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:40:31,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:40:31,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:40:31,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:40:31,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:40:31,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:40:31,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:40:31,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:40:31,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:40:31,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:40:31,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:40:31,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:40:31,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:40:31,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:40:31,795 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:40:31,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:40:31,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:40:31,818 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:40:31,819 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:40:31,819 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:40:31,819 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:40:31,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:40:31,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:40:31,821 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:40:31,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:40:31,821 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:40:31,821 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:40:31,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:40:31,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:40:31,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:40:31,822 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:40:31,822 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:40:31,822 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:40:31,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:40:31,823 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:40:31,823 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:40:31,823 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:40:31,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:40:31,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:40:31,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:40:31,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:40:31,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:40:31,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:40:31,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:40:31,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:40:31,825 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_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/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_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2022-11-02 20:40:32,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:40:32,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:40:32,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:40:32,114 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:40:32,115 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:40:32,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-11-02 20:40:32,235 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/data/f73495579/a9e5fcc5b7554811a90320cb55c5348e/FLAGb85d5c390 [2022-11-02 20:40:32,848 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:40:32,849 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2022-11-02 20:40:32,868 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/data/f73495579/a9e5fcc5b7554811a90320cb55c5348e/FLAGb85d5c390 [2022-11-02 20:40:33,114 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/data/f73495579/a9e5fcc5b7554811a90320cb55c5348e [2022-11-02 20:40:33,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:40:33,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:40:33,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:40:33,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:40:33,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:40:33,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6959ddde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33, skipping insertion in model container [2022-11-02 20:40:33,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:40:33,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:40:33,581 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_06a534db-2723-451c-b36f-cf36b7e5afa8/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-11-02 20:40:33,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:40:33,609 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:40:33,677 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_06a534db-2723-451c-b36f-cf36b7e5afa8/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2022-11-02 20:40:33,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:40:33,709 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:40:33,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33 WrapperNode [2022-11-02 20:40:33,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:40:33,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:40:33,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:40:33,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:40:33,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,793 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2022-11-02 20:40:33,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:40:33,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:40:33,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:40:33,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:40:33,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,840 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:40:33,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:40:33,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:40:33,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:40:33,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33" (1/1) ... [2022-11-02 20:40:33,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:40:33,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:33,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:40:33,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:40:33,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:40:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:40:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:40:33,958 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:40:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:40:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:40:33,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:40:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:40:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:40:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:40:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:40:33,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:40:33,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:40:33,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:40:34,172 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:40:34,174 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:40:34,676 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:40:34,686 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:40:34,689 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:40:34,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:40:34 BoogieIcfgContainer [2022-11-02 20:40:34,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:40:34,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:40:34,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:40:34,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:40:34,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:40:33" (1/3) ... [2022-11-02 20:40:34,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f7109f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:40:34, skipping insertion in model container [2022-11-02 20:40:34,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:40:33" (2/3) ... [2022-11-02 20:40:34,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f7109f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:40:34, skipping insertion in model container [2022-11-02 20:40:34,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:40:34" (3/3) ... [2022-11-02 20:40:34,704 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2022-11-02 20:40:34,725 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:40:34,726 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2022-11-02 20:40:34,796 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:40:34,806 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;@33bf9f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:40:34,806 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-11-02 20:40:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:40:34,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:40:34,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:34,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:40:34,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:34,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:34,839 INFO L85 PathProgramCache]: Analyzing trace with hash 895152213, now seen corresponding path program 1 times [2022-11-02 20:40:34,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:34,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056388418] [2022-11-02 20:40:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:35,201 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-02 20:40:35,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:35,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056388418] [2022-11-02 20:40:35,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056388418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:35,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:35,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:35,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127031249] [2022-11-02 20:40:35,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:35,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:35,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:35,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:35,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:35,249 INFO L87 Difference]: Start difference. First operand has 119 states, 62 states have (on average 2.0483870967741935) internal successors, (127), 114 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02 20:40:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:35,417 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-11-02 20:40:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:35,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-11-02 20:40:35,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:35,431 INFO L225 Difference]: With dead ends: 117 [2022-11-02 20:40:35,432 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:40:35,434 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-02 20:40:35,438 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:35,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 183 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:40:35,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:40:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-02 20:40:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 60 states have (on average 1.9333333333333333) internal successors, (116), 109 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:40:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2022-11-02 20:40:35,489 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 6 [2022-11-02 20:40:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:35,490 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2022-11-02 20:40:35,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02 20:40:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2022-11-02 20:40:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:40:35,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:35,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:40:35,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:40:35,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:35,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:35,493 INFO L85 PathProgramCache]: Analyzing trace with hash 895152214, now seen corresponding path program 1 times [2022-11-02 20:40:35,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:35,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191499220] [2022-11-02 20:40:35,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:35,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:35,617 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-02 20:40:35,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:35,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191499220] [2022-11-02 20:40:35,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191499220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:35,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:35,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:40:35,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394178288] [2022-11-02 20:40:35,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:35,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:40:35,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:35,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:40:35,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:40:35,636 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02 20:40:35,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:35,767 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-11-02 20:40:35,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:40:35,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-11-02 20:40:35,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:35,769 INFO L225 Difference]: With dead ends: 112 [2022-11-02 20:40:35,770 INFO L226 Difference]: Without dead ends: 112 [2022-11-02 20:40:35,770 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-02 20:40:35,771 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:35,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:40:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-02 20:40:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-02 20:40:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 60 states have (on average 1.9) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:40:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2022-11-02 20:40:35,784 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 6 [2022-11-02 20:40:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:35,785 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2022-11-02 20:40:35,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-02 20:40:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2022-11-02 20:40:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:40:35,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:35,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:35,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:40:35,786 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash 972366423, now seen corresponding path program 1 times [2022-11-02 20:40:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:35,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072874461] [2022-11-02 20:40:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:35,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:35,930 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-02 20:40:35,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:35,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072874461] [2022-11-02 20:40:35,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072874461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:35,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:35,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:40:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956716161] [2022-11-02 20:40:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:35,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:40:35,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:35,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:40:35,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:40:35,933 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-02 20:40:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:36,116 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-11-02 20:40:36,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:40:36,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2022-11-02 20:40:36,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:36,122 INFO L225 Difference]: With dead ends: 119 [2022-11-02 20:40:36,123 INFO L226 Difference]: Without dead ends: 119 [2022-11-02 20:40:36,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:40:36,125 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:36,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 275 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:40:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-02 20:40:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2022-11-02 20:40:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 108 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:40:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2022-11-02 20:40:36,139 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 13 [2022-11-02 20:40:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:36,140 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2022-11-02 20:40:36,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-02 20:40:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2022-11-02 20:40:36,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:40:36,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:36,141 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:36,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:40:36,142 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:36,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573860, now seen corresponding path program 1 times [2022-11-02 20:40:36,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:36,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781693243] [2022-11-02 20:40:36,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:36,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:36,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:36,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:40:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:40:36,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:36,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781693243] [2022-11-02 20:40:36,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781693243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:36,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:36,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:40:36,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054897773] [2022-11-02 20:40:36,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:36,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:40:36,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:36,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:40:36,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:40:36,469 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:40:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:36,784 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-11-02 20:40:36,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:40:36,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-02 20:40:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:36,788 INFO L225 Difference]: With dead ends: 113 [2022-11-02 20:40:36,788 INFO L226 Difference]: Without dead ends: 113 [2022-11-02 20:40:36,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:40:36,790 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 13 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:36,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 387 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:40:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-02 20:40:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2022-11-02 20:40:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 61 states have (on average 1.8688524590163935) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:40:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2022-11-02 20:40:36,801 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 22 [2022-11-02 20:40:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:36,802 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2022-11-02 20:40:36,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:40:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2022-11-02 20:40:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:40:36,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:36,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:36,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:40:36,804 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1029573859, now seen corresponding path program 1 times [2022-11-02 20:40:36,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:36,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968373338] [2022-11-02 20:40:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:36,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:36,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:37,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:40:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:40:37,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:37,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968373338] [2022-11-02 20:40:37,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968373338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:37,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:37,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:40:37,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583285877] [2022-11-02 20:40:37,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:37,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:40:37,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:37,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:40:37,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:40:37,103 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:40:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:37,389 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-11-02 20:40:37,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:40:37,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-02 20:40:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:37,391 INFO L225 Difference]: With dead ends: 112 [2022-11-02 20:40:37,391 INFO L226 Difference]: Without dead ends: 112 [2022-11-02 20:40:37,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:40:37,392 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:37,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 411 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:40:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-02 20:40:37,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2022-11-02 20:40:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:40:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2022-11-02 20:40:37,400 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 22 [2022-11-02 20:40:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:37,401 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2022-11-02 20:40:37,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:40:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-11-02 20:40:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:40:37,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:37,403 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:37,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:40:37,403 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:37,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413691, now seen corresponding path program 1 times [2022-11-02 20:40:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:37,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754015834] [2022-11-02 20:40:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:37,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:37,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:37,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:40:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:37,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:40:37,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:37,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754015834] [2022-11-02 20:40:37,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754015834] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:37,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944001585] [2022-11-02 20:40:37,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:37,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:37,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:37,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:40:37,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:40:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:37,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-02 20:40:37,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:40:38,092 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-02 20:40:38,265 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:40:38,265 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-02 20:40:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:40:38,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:40:38,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:40:38,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944001585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:40:38,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:40:38,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-11-02 20:40:38,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070610788] [2022-11-02 20:40:38,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:40:38,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:40:38,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:38,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:40:38,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:40:38,695 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:40:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:39,062 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2022-11-02 20:40:39,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:40:39,062 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-11-02 20:40:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:39,063 INFO L225 Difference]: With dead ends: 117 [2022-11-02 20:40:39,064 INFO L226 Difference]: Without dead ends: 117 [2022-11-02 20:40:39,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:40:39,065 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 27 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:39,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 839 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 434 Invalid, 0 Unknown, 184 Unchecked, 0.3s Time] [2022-11-02 20:40:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-02 20:40:39,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-02 20:40:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 111 states have internal predecessors, (118), 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-02 20:40:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2022-11-02 20:40:39,072 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 25 [2022-11-02 20:40:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:39,072 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2022-11-02 20:40:39,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:40:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2022-11-02 20:40:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:40:39,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:39,073 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:39,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:40:39,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:40:39,299 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:39,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1673413690, now seen corresponding path program 1 times [2022-11-02 20:40:39,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:39,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677180035] [2022-11-02 20:40:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:39,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:39,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:40:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:40:39,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:39,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677180035] [2022-11-02 20:40:39,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677180035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:39,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474689073] [2022-11-02 20:40:39,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:39,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:39,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:39,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:40:39,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:40:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:40,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-02 20:40:40,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:40:40,021 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-02 20:40:40,303 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:40:40,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:40:40,315 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 11 [2022-11-02 20:40:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:40:40,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:40:44,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474689073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:44,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:40:44,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-02 20:40:44,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893576335] [2022-11-02 20:40:44,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:40:44,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-02 20:40:44,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:44,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 20:40:44,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:40:44,633 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:40:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:45,442 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2022-11-02 20:40:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:40:45,443 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-11-02 20:40:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:45,444 INFO L225 Difference]: With dead ends: 118 [2022-11-02 20:40:45,444 INFO L226 Difference]: Without dead ends: 118 [2022-11-02 20:40:45,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:40:45,445 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 210 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:45,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 697 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:40:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-02 20:40:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2022-11-02 20:40:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 67 states have (on average 1.7462686567164178) internal successors, (117), 110 states have internal predecessors, (117), 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-02 20:40:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2022-11-02 20:40:45,452 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 25 [2022-11-02 20:40:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:45,452 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2022-11-02 20:40:45,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 16 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:40:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-11-02 20:40:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:40:45,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:45,454 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:45,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:40:45,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-02 20:40:45,655 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:45,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:45,656 INFO L85 PathProgramCache]: Analyzing trace with hash 512234271, now seen corresponding path program 1 times [2022-11-02 20:40:45,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:45,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311584561] [2022-11-02 20:40:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:45,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:40:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:40:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:40:46,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:46,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311584561] [2022-11-02 20:40:46,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311584561] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:46,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046185148] [2022-11-02 20:40:46,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:46,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:46,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:46,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:40:46,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:40:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:46,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-02 20:40:46,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:40:46,453 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-02 20:40:46,470 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-02 20:40:46,612 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-02 20:40:46,792 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:40:46,793 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 14 [2022-11-02 20:40:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:40:46,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:40:47,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046185148] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:47,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:40:47,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2022-11-02 20:40:47,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184097311] [2022-11-02 20:40:47,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:40:47,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:40:47,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:47,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:40:47,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:40:47,013 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:40:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:47,399 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2022-11-02 20:40:47,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:40:47,399 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-11-02 20:40:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:47,400 INFO L225 Difference]: With dead ends: 140 [2022-11-02 20:40:47,400 INFO L226 Difference]: Without dead ends: 140 [2022-11-02 20:40:47,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:40:47,401 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 126 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:47,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 302 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 268 Invalid, 0 Unknown, 83 Unchecked, 0.3s Time] [2022-11-02 20:40:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-02 20:40:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2022-11-02 20:40:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 112 states have internal predecessors, (121), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:40:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2022-11-02 20:40:47,409 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 37 [2022-11-02 20:40:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:47,410 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2022-11-02 20:40:47,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:40:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2022-11-02 20:40:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:40:47,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:47,411 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:47,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:40:47,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:40:47,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:47,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:47,643 INFO L85 PathProgramCache]: Analyzing trace with hash 512234272, now seen corresponding path program 1 times [2022-11-02 20:40:47,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:47,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198273486] [2022-11-02 20:40:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:47,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:48,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:40:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:48,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:40:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:40:48,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:48,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198273486] [2022-11-02 20:40:48,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198273486] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:48,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613428961] [2022-11-02 20:40:48,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:48,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:48,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:48,391 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:40:48,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:40:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:48,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-02 20:40:48,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:40:48,574 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-02 20:40:48,604 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-02 20:40:48,725 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-11-02 20:40:48,728 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-11-02 20:40:48,767 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-02 20:40:50,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:40:50,872 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-02 20:40:50,972 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-02 20:40:53,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:40:53,105 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-02 20:40:53,114 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:40:53,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:40:53,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613428961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:53,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:40:53,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 16 [2022-11-02 20:40:53,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801907351] [2022-11-02 20:40:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:53,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:40:53,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:53,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:40:53,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=192, Unknown=3, NotChecked=28, Total=272 [2022-11-02 20:40:53,117 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 9 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:40:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:53,382 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-11-02 20:40:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:40:53,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-11-02 20:40:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:53,384 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:40:53,384 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:40:53,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=54, Invalid=219, Unknown=3, NotChecked=30, Total=306 [2022-11-02 20:40:53,386 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 80 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:53,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 272 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 169 Invalid, 0 Unknown, 146 Unchecked, 0.2s Time] [2022-11-02 20:40:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:40:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-02 20:40:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 76 states have (on average 1.5) internal successors, (114), 106 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:40:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2022-11-02 20:40:53,391 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 37 [2022-11-02 20:40:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:53,392 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2022-11-02 20:40:53,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:40:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2022-11-02 20:40:53,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:40:53,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:53,393 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:53,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:40:53,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:53,615 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:53,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash -47629334, now seen corresponding path program 1 times [2022-11-02 20:40:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:53,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272632693] [2022-11-02 20:40:53,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:53,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:53,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:40:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:53,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:40:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:40:53,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:53,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272632693] [2022-11-02 20:40:53,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272632693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:53,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:53,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:40:53,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895270959] [2022-11-02 20:40:53,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:53,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:40:53,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:53,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:40:53,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:40:53,794 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:40:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:54,079 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-11-02 20:40:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:40:54,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-02 20:40:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:54,081 INFO L225 Difference]: With dead ends: 130 [2022-11-02 20:40:54,082 INFO L226 Difference]: Without dead ends: 130 [2022-11-02 20:40:54,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:40:54,083 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 73 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:54,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 278 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:40:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-02 20:40:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2022-11-02 20:40:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 104 states have internal predecessors, (112), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:40:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2022-11-02 20:40:54,089 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 40 [2022-11-02 20:40:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:54,089 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2022-11-02 20:40:54,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:40:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2022-11-02 20:40:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:40:54,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:54,091 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:54,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:40:54,091 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:54,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:54,092 INFO L85 PathProgramCache]: Analyzing trace with hash -47629333, now seen corresponding path program 1 times [2022-11-02 20:40:54,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:54,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895872895] [2022-11-02 20:40:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:54,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:40:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:40:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:40:54,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:54,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895872895] [2022-11-02 20:40:54,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895872895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:54,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:54,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:40:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717862660] [2022-11-02 20:40:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:54,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:40:54,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:54,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:40:54,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:40:54,389 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:40:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:54,671 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-11-02 20:40:54,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:40:54,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-02 20:40:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:54,673 INFO L225 Difference]: With dead ends: 110 [2022-11-02 20:40:54,673 INFO L226 Difference]: Without dead ends: 110 [2022-11-02 20:40:54,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:40:54,674 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:54,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 285 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:40:54,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-02 20:40:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-02 20:40:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 102 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:40:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-11-02 20:40:54,678 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 40 [2022-11-02 20:40:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:54,678 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-11-02 20:40:54,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:40:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-11-02 20:40:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:40:54,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:54,680 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:54,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:40:54,680 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:54,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1476263067, now seen corresponding path program 1 times [2022-11-02 20:40:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:54,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973404151] [2022-11-02 20:40:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:55,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:55,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:40:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:55,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:40:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:40:55,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:55,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973404151] [2022-11-02 20:40:55,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973404151] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:55,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801878700] [2022-11-02 20:40:55,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:55,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:55,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:55,539 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:40:55,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:40:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:55,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 20:40:55,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:40:56,090 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 9 treesize of output 5 [2022-11-02 20:40:56,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:40:56,377 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 16 treesize of output 18 [2022-11-02 20:40:56,407 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-02 20:40:56,407 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 18 [2022-11-02 20:40:56,525 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 17 treesize of output 9 [2022-11-02 20:40:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:40:56,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:40:56,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801878700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:56,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:40:56,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-11-02 20:40:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649118514] [2022-11-02 20:40:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:56,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:40:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:56,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:40:56,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=622, Unknown=2, NotChecked=0, Total=702 [2022-11-02 20:40:56,550 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:40:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:57,056 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-11-02 20:40:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:40:57,057 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-11-02 20:40:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:57,058 INFO L225 Difference]: With dead ends: 155 [2022-11-02 20:40:57,058 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 20:40:57,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=112, Invalid=756, Unknown=2, NotChecked=0, Total=870 [2022-11-02 20:40:57,059 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 76 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:57,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 677 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 105 Unchecked, 0.4s Time] [2022-11-02 20:40:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 20:40:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-11-02 20:40:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 101 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:40:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2022-11-02 20:40:57,063 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 41 [2022-11-02 20:40:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:57,064 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2022-11-02 20:40:57,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:40:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2022-11-02 20:40:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:40:57,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:57,065 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:57,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:40:57,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:57,279 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:40:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1476263066, now seen corresponding path program 1 times [2022-11-02 20:40:57,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:57,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015314411] [2022-11-02 20:40:57,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:57,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:57,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:40:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:58,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:40:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:40:58,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:58,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015314411] [2022-11-02 20:40:58,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015314411] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:40:58,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731929959] [2022-11-02 20:40:58,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:58,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:40:58,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:40:58,532 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:40:58,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:40:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:58,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-02 20:40:58,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:40:59,309 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 25 treesize of output 17 [2022-11-02 20:40:59,315 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 19 treesize of output 11 [2022-11-02 20:40:59,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:40:59,746 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 31 treesize of output 31 [2022-11-02 20:40:59,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:40:59,755 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 22 treesize of output 24 [2022-11-02 20:40:59,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:40:59,764 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 29 treesize of output 29 [2022-11-02 20:40:59,775 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:40:59,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:40:59,905 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 23 treesize of output 15 [2022-11-02 20:40:59,912 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 26 treesize of output 14 [2022-11-02 20:41:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:41:00,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:41:01,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731929959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:01,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:41:01,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2022-11-02 20:41:01,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930315800] [2022-11-02 20:41:01,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:41:01,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:41:01,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:01,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:41:01,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1221, Unknown=2, NotChecked=0, Total=1332 [2022-11-02 20:41:01,573 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:41:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:03,881 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-11-02 20:41:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:41:03,882 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-11-02 20:41:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:03,883 INFO L225 Difference]: With dead ends: 165 [2022-11-02 20:41:03,883 INFO L226 Difference]: Without dead ends: 165 [2022-11-02 20:41:03,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=229, Invalid=2215, Unknown=6, NotChecked=0, Total=2450 [2022-11-02 20:41:03,884 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 188 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:03,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1491 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1041 Invalid, 0 Unknown, 114 Unchecked, 1.1s Time] [2022-11-02 20:41:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-02 20:41:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 117. [2022-11-02 20:41:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 85 states have (on average 1.388235294117647) internal successors, (118), 109 states have internal predecessors, (118), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:41:03,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2022-11-02 20:41:03,888 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 41 [2022-11-02 20:41:03,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:03,889 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2022-11-02 20:41:03,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:41:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2022-11-02 20:41:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:41:03,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:03,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:03,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:04,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:41:04,090 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:41:04,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1472852043, now seen corresponding path program 1 times [2022-11-02 20:41:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:04,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725336740] [2022-11-02 20:41:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:41:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:41:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:41:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:41:04,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:04,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725336740] [2022-11-02 20:41:04,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725336740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:04,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:04,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:41:04,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136312313] [2022-11-02 20:41:04,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:04,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:41:04,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:04,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:41:04,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:04,273 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:04,424 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2022-11-02 20:41:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:41:04,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-11-02 20:41:04,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:04,425 INFO L225 Difference]: With dead ends: 134 [2022-11-02 20:41:04,425 INFO L226 Difference]: Without dead ends: 134 [2022-11-02 20:41:04,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:04,426 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 87 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:04,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 177 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:04,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-02 20:41:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2022-11-02 20:41:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.3764705882352941) internal successors, (117), 108 states have internal predecessors, (117), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:41:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2022-11-02 20:41:04,431 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 42 [2022-11-02 20:41:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:04,432 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2022-11-02 20:41:04,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:04,432 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2022-11-02 20:41:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:41:04,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:04,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:04,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:41:04,433 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:41:04,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:04,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1472852044, now seen corresponding path program 1 times [2022-11-02 20:41:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:04,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14806492] [2022-11-02 20:41:04,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:04,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:41:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:41:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:41:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:41:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:04,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14806492] [2022-11-02 20:41:04,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14806492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:04,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:41:04,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:41:04,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028021873] [2022-11-02 20:41:04,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:04,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:41:04,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:04,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:41:04,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:41:04,779 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 8 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:04,934 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2022-11-02 20:41:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:41:04,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-11-02 20:41:04,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:04,935 INFO L225 Difference]: With dead ends: 113 [2022-11-02 20:41:04,935 INFO L226 Difference]: Without dead ends: 113 [2022-11-02 20:41:04,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:41:04,936 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 263 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:04,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 140 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:41:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-02 20:41:04,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-11-02 20:41:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 105 states have internal predecessors, (114), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:41:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2022-11-02 20:41:04,940 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 42 [2022-11-02 20:41:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:04,940 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2022-11-02 20:41:04,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:41:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2022-11-02 20:41:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:41:04,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:04,941 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:04,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:41:04,941 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:41:04,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1928392465, now seen corresponding path program 1 times [2022-11-02 20:41:04,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:04,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996256847] [2022-11-02 20:41:04,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:04,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:41:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:05,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:41:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:05,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:41:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:41:05,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:05,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996256847] [2022-11-02 20:41:05,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996256847] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:05,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49868088] [2022-11-02 20:41:05,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:05,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:05,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:05,923 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:05,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:41:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:06,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 20:41:06,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:06,472 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 8 treesize of output 4 [2022-11-02 20:41:06,559 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1619 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1619) |c_#memory_$Pointer$.base|))) is different from true [2022-11-02 20:41:06,574 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1620 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1620))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-02 20:41:06,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:06,612 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 15 treesize of output 17 [2022-11-02 20:41:06,658 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 16 treesize of output 8 [2022-11-02 20:41:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-02 20:41:06,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:41:06,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1624 (Array Int Int)) (|v_node_create_~temp~0#1.base_34| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1624) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)) (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:41:06,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49868088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:06,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:41:06,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2022-11-02 20:41:06,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102731726] [2022-11-02 20:41:06,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:41:06,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:41:06,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:06,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:41:06,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=900, Unknown=3, NotChecked=186, Total=1190 [2022-11-02 20:41:06,779 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 33 states, 31 states have (on average 2.096774193548387) internal successors, (65), 28 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:41:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:07,849 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-11-02 20:41:07,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:41:07,850 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.096774193548387) internal successors, (65), 28 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 44 [2022-11-02 20:41:07,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:07,851 INFO L225 Difference]: With dead ends: 112 [2022-11-02 20:41:07,851 INFO L226 Difference]: Without dead ends: 112 [2022-11-02 20:41:07,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=181, Invalid=1548, Unknown=5, NotChecked=246, Total=1980 [2022-11-02 20:41:07,852 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 56 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:07,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1167 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 752 Invalid, 0 Unknown, 178 Unchecked, 0.6s Time] [2022-11-02 20:41:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-02 20:41:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-11-02 20:41:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 102 states have internal predecessors, (110), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:41:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-11-02 20:41:07,861 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 44 [2022-11-02 20:41:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:07,861 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-11-02 20:41:07,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.096774193548387) internal successors, (65), 28 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:41:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-11-02 20:41:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:41:07,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:07,864 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:07,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:08,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:41:08,067 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:41:08,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:08,068 INFO L85 PathProgramCache]: Analyzing trace with hash -710984888, now seen corresponding path program 1 times [2022-11-02 20:41:08,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:08,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139338075] [2022-11-02 20:41:08,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:08,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:09,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:41:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:09,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:41:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:09,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:41:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:41:09,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:09,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139338075] [2022-11-02 20:41:09,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139338075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:09,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842413834] [2022-11-02 20:41:09,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:09,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:09,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:09,992 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:10,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:41:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:10,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-02 20:41:10,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:10,282 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-02 20:41:10,630 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:41:10,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:41:10,783 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-02 20:41:10,994 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:41:10,994 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:41:11,264 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:41:11,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2022-11-02 20:41:11,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2022-11-02 20:41:11,278 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 7 treesize of output 3 [2022-11-02 20:41:11,501 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1787 (Array Int Int)) (v_ArrVal_1786 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1787)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1786)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-02 20:41:11,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:11,578 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:41:11,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, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 51 [2022-11-02 20:41:11,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:11,589 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 51 treesize of output 49 [2022-11-02 20:41:11,630 INFO L356 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2022-11-02 20:41:11,631 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 40 treesize of output 60 [2022-11-02 20:41:11,768 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 52 treesize of output 36 [2022-11-02 20:41:12,019 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:41:12,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-11-02 20:41:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-02 20:41:12,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:41:12,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1797 (Array Int Int)) (v_ArrVal_1796 (Array Int Int)) (|v_node_create_~temp~0#1.base_37| Int) (v_ArrVal_1798 Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_37| v_ArrVal_1797) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (not (<= 0 .cse0)) (not (< |v_node_create_~temp~0#1.base_37| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_37|) 0)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_37| v_ArrVal_1798) (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_37| v_ArrVal_1796))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) .cse0)) 1)))) is different from false [2022-11-02 20:41:12,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842413834] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:12,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:41:12,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2022-11-02 20:41:12,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348502805] [2022-11-02 20:41:12,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:41:12,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 20:41:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:12,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 20:41:12,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2101, Unknown=2, NotChecked=186, Total=2450 [2022-11-02 20:41:12,506 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:41:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:14,238 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2022-11-02 20:41:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:41:14,238 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-02 20:41:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:14,239 INFO L225 Difference]: With dead ends: 139 [2022-11-02 20:41:14,240 INFO L226 Difference]: Without dead ends: 139 [2022-11-02 20:41:14,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=273, Invalid=3155, Unknown=2, NotChecked=230, Total=3660 [2022-11-02 20:41:14,241 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 78 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:14,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1140 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1033 Invalid, 0 Unknown, 188 Unchecked, 0.9s Time] [2022-11-02 20:41:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-02 20:41:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2022-11-02 20:41:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.315217391304348) internal successors, (121), 111 states have internal predecessors, (121), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:41:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2022-11-02 20:41:14,247 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 46 [2022-11-02 20:41:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:14,247 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2022-11-02 20:41:14,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:41:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2022-11-02 20:41:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:41:14,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:14,249 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:14,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-02 20:41:14,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:41:14,459 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:41:14,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash -710984887, now seen corresponding path program 1 times [2022-11-02 20:41:14,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:14,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340717162] [2022-11-02 20:41:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:15,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:41:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:15,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:41:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:16,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:41:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:41:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:16,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340717162] [2022-11-02 20:41:16,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340717162] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:16,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585899328] [2022-11-02 20:41:16,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:16,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:16,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:16,887 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:16,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:41:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:17,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-02 20:41:17,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:17,169 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-02 20:41:17,596 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:41:17,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:41:17,778 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-02 20:41:17,790 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-02 20:41:18,052 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:41:18,053 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-11-02 20:41:18,065 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 18 treesize of output 20 [2022-11-02 20:41:18,460 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:41:18,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2022-11-02 20:41:18,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-11-02 20:41:18,722 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1964 (Array Int Int)) (v_ArrVal_1963 (Array Int Int))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1963)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1964)))) is different from true [2022-11-02 20:41:18,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:18,801 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:41:18,802 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 85 treesize of output 75 [2022-11-02 20:41:18,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:18,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:18,820 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:41:18,821 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 83 treesize of output 80 [2022-11-02 20:41:18,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:18,833 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 26 treesize of output 21 [2022-11-02 20:41:18,858 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-02 20:41:18,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 20:41:19,330 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:41:19,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2022-11-02 20:41:19,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-11-02 20:41:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-02 20:41:19,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:41:20,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585899328] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:20,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:41:20,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2022-11-02 20:41:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898237981] [2022-11-02 20:41:20,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:41:20,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-02 20:41:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:20,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-02 20:41:20,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2905, Unknown=1, NotChecked=108, Total=3192 [2022-11-02 20:41:20,374 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 50 states, 45 states have (on average 1.711111111111111) internal successors, (77), 43 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:41:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:25,243 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2022-11-02 20:41:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:41:25,245 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 1.711111111111111) internal successors, (77), 43 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-02 20:41:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:25,246 INFO L225 Difference]: With dead ends: 228 [2022-11-02 20:41:25,246 INFO L226 Difference]: Without dead ends: 228 [2022-11-02 20:41:25,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=399, Invalid=5304, Unknown=1, NotChecked=148, Total=5852 [2022-11-02 20:41:25,249 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 356 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:25,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 2314 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2940 Invalid, 0 Unknown, 319 Unchecked, 2.6s Time] [2022-11-02 20:41:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-02 20:41:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 118. [2022-11-02 20:41:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 110 states have internal predecessors, (119), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:41:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2022-11-02 20:41:25,259 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 46 [2022-11-02 20:41:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:25,260 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2022-11-02 20:41:25,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 1.711111111111111) internal successors, (77), 43 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:41:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2022-11-02 20:41:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 20:41:25,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:25,261 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:25,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:25,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:41:25,483 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:41:25,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:25,483 INFO L85 PathProgramCache]: Analyzing trace with hash 127582861, now seen corresponding path program 2 times [2022-11-02 20:41:25,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:25,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46823172] [2022-11-02 20:41:25,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:25,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:25,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:41:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:25,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:41:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:41:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:25,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:41:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-02 20:41:25,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:25,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46823172] [2022-11-02 20:41:25,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46823172] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:25,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173135288] [2022-11-02 20:41:25,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:41:25,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:25,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:25,657 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:25,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:41:25,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:41:25,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:41:25,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:41:25,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:41:25,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:41:25,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173135288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:41:25,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:41:25,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-02 20:41:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628096407] [2022-11-02 20:41:25,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:41:25,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:41:25,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:25,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:41:25,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:25,983 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:41:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:41:26,000 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-11-02 20:41:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:41:26,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-11-02 20:41:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:41:26,002 INFO L225 Difference]: With dead ends: 103 [2022-11-02 20:41:26,002 INFO L226 Difference]: Without dead ends: 103 [2022-11-02 20:41:26,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:41:26,004 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 138 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:41:26,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 98 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:41:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-02 20:41:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-02 20:41:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 97 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:41:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-11-02 20:41:26,017 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 49 [2022-11-02 20:41:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:41:26,017 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-11-02 20:41:26,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:41:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-11-02 20:41:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:41:26,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:41:26,018 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:41:26,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:41:26,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:26,240 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:41:26,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:41:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash 555333, now seen corresponding path program 2 times [2022-11-02 20:41:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:41:26,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296094211] [2022-11-02 20:41:26,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:41:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:41:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:27,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:41:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:27,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:41:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:28,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:41:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:41:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:41:28,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:41:28,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296094211] [2022-11-02 20:41:28,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296094211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:28,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875521254] [2022-11-02 20:41:28,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:41:28,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:41:28,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:41:28,615 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:41:28,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:41:28,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:41:28,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:41:28,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 137 conjunts are in the unsatisfiable core [2022-11-02 20:41:28,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:41:28,910 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-02 20:41:29,209 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:41:29,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:41:29,351 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-02 20:41:29,363 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-02 20:41:29,554 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:41:29,555 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-11-02 20:41:29,564 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 18 treesize of output 20 [2022-11-02 20:41:46,266 INFO L356 Elim1Store]: treesize reduction 72, result has 29.4 percent of original size [2022-11-02 20:41:46,267 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 78 [2022-11-02 20:41:46,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:46,293 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-02 20:41:46,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 53 [2022-11-02 20:41:46,321 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-02 20:41:46,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:41:47,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:47,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:41:47,866 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:41:47,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 30 [2022-11-02 20:41:48,285 INFO L356 Elim1Store]: treesize reduction 102, result has 15.7 percent of original size [2022-11-02 20:41:48,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 57 [2022-11-02 20:41:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:41:48,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:41:48,506 INFO L356 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-11-02 20:41:48,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-11-02 20:41:51,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875521254] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:41:51,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:41:51,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 58 [2022-11-02 20:41:51,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351327376] [2022-11-02 20:41:51,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:41:51,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-02 20:41:51,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:41:51,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-02 20:41:51,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=4041, Unknown=8, NotChecked=0, Total=4290 [2022-11-02 20:41:51,450 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 59 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 52 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:08,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:08,760 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2022-11-02 20:42:08,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 20:42:08,761 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 52 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-11-02 20:42:08,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:08,762 INFO L225 Difference]: With dead ends: 126 [2022-11-02 20:42:08,762 INFO L226 Difference]: Without dead ends: 126 [2022-11-02 20:42:08,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1918 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=425, Invalid=6535, Unknown=12, NotChecked=0, Total=6972 [2022-11-02 20:42:08,763 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 68 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:08,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1438 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1281 Invalid, 0 Unknown, 129 Unchecked, 1.2s Time] [2022-11-02 20:42:08,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-02 20:42:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 105. [2022-11-02 20:42:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:42:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2022-11-02 20:42:08,768 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 51 [2022-11-02 20:42:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:08,768 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2022-11-02 20:42:08,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 52 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2022-11-02 20:42:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:42:08,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:08,770 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:08,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:08,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-02 20:42:08,991 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:42:08,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:08,991 INFO L85 PathProgramCache]: Analyzing trace with hash 555334, now seen corresponding path program 2 times [2022-11-02 20:42:08,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:08,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82317676] [2022-11-02 20:42:08,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:08,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:10,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:10,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:42:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:10,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:42:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:42:11,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:11,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82317676] [2022-11-02 20:42:11,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82317676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:11,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446422316] [2022-11-02 20:42:11,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:42:11,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:11,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:11,272 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:11,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:42:11,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:42:11,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:42:11,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-02 20:42:11,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:11,582 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-02 20:42:12,013 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:42:12,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:42:12,190 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-02 20:42:12,199 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-02 20:42:12,480 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:42:12,480 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2022-11-02 20:42:12,489 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 22 [2022-11-02 20:42:12,880 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-02 20:42:12,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 50 [2022-11-02 20:42:12,892 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:42:12,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2022-11-02 20:42:15,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:15,512 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-02 20:42:15,512 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 114 treesize of output 102 [2022-11-02 20:42:15,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:15,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:15,536 INFO L356 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2022-11-02 20:42:15,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 120 treesize of output 111 [2022-11-02 20:42:15,561 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-02 20:42:15,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 20:42:17,076 INFO L356 Elim1Store]: treesize reduction 89, result has 11.0 percent of original size [2022-11-02 20:42:17,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 142 treesize of output 66 [2022-11-02 20:42:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:17,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:42:18,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446422316] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:18,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:42:18,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2022-11-02 20:42:18,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498119930] [2022-11-02 20:42:18,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:42:18,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-02 20:42:18,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:18,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-02 20:42:18,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3428, Unknown=11, NotChecked=0, Total=3660 [2022-11-02 20:42:18,376 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 54 states, 50 states have (on average 1.72) internal successors, (86), 47 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:22,239 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-11-02 20:42:22,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:42:22,240 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 50 states have (on average 1.72) internal successors, (86), 47 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-11-02 20:42:22,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:22,241 INFO L225 Difference]: With dead ends: 89 [2022-11-02 20:42:22,241 INFO L226 Difference]: Without dead ends: 89 [2022-11-02 20:42:22,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=334, Invalid=4763, Unknown=15, NotChecked=0, Total=5112 [2022-11-02 20:42:22,243 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:22,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1426 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 744 Invalid, 0 Unknown, 90 Unchecked, 0.6s Time] [2022-11-02 20:42:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-02 20:42:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-11-02 20:42:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 82 states have internal predecessors, (87), 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-02 20:42:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-11-02 20:42:22,248 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 51 [2022-11-02 20:42:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:22,248 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-11-02 20:42:22,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 50 states have (on average 1.72) internal successors, (86), 47 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-11-02 20:42:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:42:22,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:22,250 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:22,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:22,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:22,467 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:42:22,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:22,468 INFO L85 PathProgramCache]: Analyzing trace with hash 430095050, now seen corresponding path program 1 times [2022-11-02 20:42:22,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:22,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041756289] [2022-11-02 20:42:22,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:22,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:23,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:23,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:42:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:23,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:42:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:42:23,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:23,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041756289] [2022-11-02 20:42:23,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041756289] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:23,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108722943] [2022-11-02 20:42:23,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:23,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:23,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:23,655 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:23,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:42:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:23,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-02 20:42:23,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:24,399 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 7 treesize of output 3 [2022-11-02 20:42:24,490 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2735 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2735)))) is different from true [2022-11-02 20:42:24,500 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2736 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2736) |c_#memory_$Pointer$.base|)))) is different from true [2022-11-02 20:42:24,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:24,526 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 16 treesize of output 18 [2022-11-02 20:42:24,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:42:24,912 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-02 20:42:24,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:24,999 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 16 treesize of output 18 [2022-11-02 20:42:25,075 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 17 treesize of output 9 [2022-11-02 20:42:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-02 20:42:25,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:42:25,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:42:25,210 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-02 20:42:25,221 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:42:25,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-11-02 20:42:25,250 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 7 treesize of output 5 [2022-11-02 20:42:25,485 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:42:25,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:42:25,808 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((|v_node_create_~temp~0#1.base_49| Int)) (or (not (< |v_node_create_~temp~0#1.base_49| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2743 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_49| v_ArrVal_2743) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |c_ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-11-02 20:42:25,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108722943] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:25,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:42:25,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2022-11-02 20:42:25,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748507257] [2022-11-02 20:42:25,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:42:25,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-02 20:42:25,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:25,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-02 20:42:25,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1603, Unknown=19, NotChecked=246, Total=1980 [2022-11-02 20:42:25,813 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 39 states, 36 states have (on average 2.25) internal successors, (81), 34 states have internal predecessors, (81), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 20:42:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:27,674 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2022-11-02 20:42:27,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:42:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 2.25) internal successors, (81), 34 states have internal predecessors, (81), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-11-02 20:42:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:27,679 INFO L225 Difference]: With dead ends: 157 [2022-11-02 20:42:27,679 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 20:42:27,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=251, Invalid=3045, Unknown=22, NotChecked=342, Total=3660 [2022-11-02 20:42:27,681 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 386 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:27,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1040 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1166 Invalid, 0 Unknown, 271 Unchecked, 1.0s Time] [2022-11-02 20:42:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 20:42:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 97. [2022-11-02 20:42:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 91 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:42:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2022-11-02 20:42:27,685 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 52 [2022-11-02 20:42:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:27,685 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2022-11-02 20:42:27,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 2.25) internal successors, (81), 34 states have internal predecessors, (81), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-02 20:42:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2022-11-02 20:42:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:42:27,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:27,686 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:27,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:27,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:27,895 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:42:27,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:27,895 INFO L85 PathProgramCache]: Analyzing trace with hash 430095051, now seen corresponding path program 1 times [2022-11-02 20:42:27,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:27,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260623491] [2022-11-02 20:42:27,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:27,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:28,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:42:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:28,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:42:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:42:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:29,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260623491] [2022-11-02 20:42:29,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260623491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:29,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:29,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-02 20:42:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277777346] [2022-11-02 20:42:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:29,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:42:29,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:29,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:42:29,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:42:29,048 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:42:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:29,631 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-11-02 20:42:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:42:29,632 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-11-02 20:42:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:29,633 INFO L225 Difference]: With dead ends: 104 [2022-11-02 20:42:29,633 INFO L226 Difference]: Without dead ends: 104 [2022-11-02 20:42:29,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:42:29,634 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 291 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:29,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 421 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:42:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-02 20:42:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-11-02 20:42:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.2625) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:42:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-11-02 20:42:29,646 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 52 [2022-11-02 20:42:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:29,646 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-11-02 20:42:29,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:42:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-11-02 20:42:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-02 20:42:29,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:29,648 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:29,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:42:29,648 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:42:29,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:29,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1004484877, now seen corresponding path program 1 times [2022-11-02 20:42:29,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:29,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961601313] [2022-11-02 20:42:29,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:29,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:30,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:42:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:30,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:42:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:42:31,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:31,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961601313] [2022-11-02 20:42:31,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961601313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:31,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341381193] [2022-11-02 20:42:31,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:31,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:31,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:31,304 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:31,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:42:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:31,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-02 20:42:31,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:31,666 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-02 20:42:31,979 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:42:31,980 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-02 20:42:32,177 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-02 20:42:32,370 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:42:32,371 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:42:32,647 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:42:32,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2022-11-02 20:42:32,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2022-11-02 20:42:32,661 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 7 treesize of output 3 [2022-11-02 20:42:32,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:32,959 INFO L356 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-02 20:42:32,960 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 55 treesize of output 46 [2022-11-02 20:42:32,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:32,967 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 53 treesize of output 44 [2022-11-02 20:42:32,991 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-02 20:42:32,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 20:42:33,155 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 35 treesize of output 23 [2022-11-02 20:42:33,356 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:42:33,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2022-11-02 20:42:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:33,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:42:33,749 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_26| Int) (v_ArrVal_3065 (Array Int Int)) (v_ArrVal_3066 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_26| v_ArrVal_3066) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_26|) 0)) (not (<= 0 .cse0)) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_26| |c_#StackHeapBarrier|)) (not (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_26| v_ArrVal_3065))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse1 (select (select .cse2 .cse1) .cse0)))))))) is different from false [2022-11-02 20:42:33,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341381193] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:33,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:42:33,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2022-11-02 20:42:33,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670495257] [2022-11-02 20:42:33,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:42:33,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-02 20:42:33,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:33,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-02 20:42:33,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2377, Unknown=1, NotChecked=98, Total=2652 [2022-11-02 20:42:33,754 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 47 states, 43 states have (on average 1.813953488372093) internal successors, (78), 39 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:36,749 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-11-02 20:42:36,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:42:36,750 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.813953488372093) internal successors, (78), 39 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-11-02 20:42:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:36,750 INFO L225 Difference]: With dead ends: 91 [2022-11-02 20:42:36,750 INFO L226 Difference]: Without dead ends: 91 [2022-11-02 20:42:36,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=383, Invalid=3526, Unknown=1, NotChecked=122, Total=4032 [2022-11-02 20:42:36,752 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 212 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:36,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1248 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:42:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-02 20:42:36,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-02 20:42:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 85 states have internal predecessors, (91), 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-02 20:42:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-11-02 20:42:36,755 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 54 [2022-11-02 20:42:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:36,756 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-11-02 20:42:36,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.813953488372093) internal successors, (78), 39 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:42:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-11-02 20:42:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-02 20:42:36,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:36,757 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:36,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:36,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-02 20:42:36,958 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:42:36,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:36,958 INFO L85 PathProgramCache]: Analyzing trace with hash 888325895, now seen corresponding path program 1 times [2022-11-02 20:42:36,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:36,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294003462] [2022-11-02 20:42:36,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:36,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:37,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:37,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:42:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:37,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:42:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:42:37,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:37,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294003462] [2022-11-02 20:42:37,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294003462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:37,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:37,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:42:37,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525400857] [2022-11-02 20:42:37,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:37,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:42:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:37,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:42:37,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:42:37,560 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:42:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:38,066 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-11-02 20:42:38,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:42:38,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2022-11-02 20:42:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:42:38,067 INFO L225 Difference]: With dead ends: 111 [2022-11-02 20:42:38,067 INFO L226 Difference]: Without dead ends: 111 [2022-11-02 20:42:38,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:42:38,068 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 166 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:42:38,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 392 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:42:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-02 20:42:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2022-11-02 20:42:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 71 states have (on average 1.267605633802817) internal successors, (90), 85 states have internal predecessors, (90), 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-02 20:42:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2022-11-02 20:42:38,072 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 57 [2022-11-02 20:42:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:42:38,073 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2022-11-02 20:42:38,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:42:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2022-11-02 20:42:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:42:38,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:42:38,074 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:38,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:42:38,074 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-11-02 20:42:38,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:38,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1017304566, now seen corresponding path program 1 times [2022-11-02 20:42:38,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:38,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931023993] [2022-11-02 20:42:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:38,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:40,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:42:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:42:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:40,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:42:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:42:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:41,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931023993] [2022-11-02 20:42:41,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931023993] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:42:41,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244580666] [2022-11-02 20:42:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:41,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:41,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:41,392 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:41,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_06a534db-2723-451c-b36f-cf36b7e5afa8/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:42:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:41,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 150 conjunts are in the unsatisfiable core [2022-11-02 20:42:41,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:41,698 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-02 20:42:41,794 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-02 20:42:41,992 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:42:41,993 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-02 20:42:42,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:42:42,289 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:42:42,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:42:42,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-02 20:42:42,800 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:42:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-02 20:42:43,227 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:42:43,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2022-11-02 20:42:43,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-02 20:42:43,588 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-02 20:42:43,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:43,905 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:42:43,905 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 57 treesize of output 49 [2022-11-02 20:42:43,932 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:42:43,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:42:43,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:43,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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-02 20:42:44,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:42:44,883 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-11-02 20:42:44,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 33 [2022-11-02 20:42:45,264 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-02 20:42:45,334 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-02 20:42:45,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:42:45,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 22 [2022-11-02 20:42:45,351 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-02 20:42:45,503 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 41 treesize of output 39 [2022-11-02 20:42:45,511 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 24 treesize of output 26 [2022-11-02 20:42:45,516 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 24 treesize of output 26 [2022-11-02 20:42:45,669 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 34 treesize of output 22 [2022-11-02 20:42:45,680 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 21 treesize of output 13 [2022-11-02 20:42:45,904 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 19 treesize of output 7 [2022-11-02 20:42:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:42:45,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:42:46,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3393 (Array Int Int)) (v_ArrVal_3391 (Array Int Int)) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3391) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3393) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-02 20:42:46,307 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:42:46,308 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-02 20:42:46,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:42:46,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 87 [2022-11-02 20:42:46,329 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:42:46,329 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 64 [2022-11-02 20:42:46,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:42:46,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 113 [2022-11-02 20:42:46,373 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 50 treesize of output 46 [2022-11-02 20:42:46,383 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 94 treesize of output 90 [2022-11-02 20:42:47,521 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse25 (not .cse19)) (.cse55 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) v_arrayElimCell_175) (+ v_arrayElimCell_176 4))))) (.cse17 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse24 (or .cse25 (and .cse55 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse67 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse67 (+ v_arrayElimCell_176 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse67 .cse17)))))))) (.cse1 (or .cse19 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) v_arrayElimCell_172) (+ v_arrayElimCell_174 4)))))) (.cse3 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse66 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse64 (select .cse66 v_arrayElimCell_172)) (.cse65 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse64 .cse65)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse64 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse66 v_arrayElimCell_175) .cse65))))))) (.cse4 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse63 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse61 (select .cse63 v_arrayElimCell_172)) (.cse60 (+ v_arrayElimCell_174 4)) (.cse59 (select .cse63 v_arrayElimCell_175)) (.cse62 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 .cse60)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse62)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse60)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 .cse62))))))) (.cse6 (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392)) (.cse58 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse57 v_arrayElimCell_172) .cse58)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse57 v_arrayElimCell_175) .cse58))))) .cse25)) (.cse10 (or (and .cse55 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse56 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 (+ v_arrayElimCell_176 4))))))) .cse25)) (.cse13 (or .cse25 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse53 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse52 (select .cse53 v_arrayElimCell_175)) (.cse54 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 v_arrayElimCell_172) .cse54)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 .cse54))))))))) (let ((.cse2 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse47 (select .cse51 v_arrayElimCell_175)) (.cse50 (+ v_arrayElimCell_176 4)) (.cse49 (select .cse51 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse48 (+ v_arrayElimCell_174 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse48)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 .cse50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 .cse48))))))) (.cse5 (or (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse45 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse44 (select .cse45 v_arrayElimCell_175)) (.cse46 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse45 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse46)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse46)))))) .cse25)) (.cse7 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse43 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse42 (+ v_arrayElimCell_176 4)) (.cse41 (select .cse43 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 .cse42)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 v_arrayElimCell_175) .cse42)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 (+ v_arrayElimCell_174 4)))))))) (.cse8 (or .cse19 (forall ((v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_174 4)))))) (.cse12 (and .cse1 .cse3 .cse4 .cse6 .cse10 .cse13)) (.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (or .cse25 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392)) (.cse40 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse40)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 v_arrayElimCell_175) .cse40))))))) (.cse11 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse20 (and (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse29 (select .cse31 v_arrayElimCell_172)) (.cse30 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse30)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse17)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse31 v_arrayElimCell_175) .cse30)))))) (or .cse19 (forall ((v_arrayElimCell_172 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) v_arrayElimCell_172) .cse17)))) .cse6 (or .cse25 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse33 (+ v_arrayElimCell_176 4)) (.cse34 (select .cse32 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse32 v_arrayElimCell_172) .cse33)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 .cse33)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 .cse17))))))) .cse24 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse35 (select .cse38 v_arrayElimCell_172)) (.cse36 (+ v_arrayElimCell_176 4)) (.cse37 (select .cse38 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 .cse36)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 .cse17)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 .cse36)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 .cse17))))))))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or .cse11 .cse12) .cse13)) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (or .cse0 .cse12) .cse10 .cse13) .cse11) (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse15 (+ v_arrayElimCell_176 4)) (.cse16 (select .cse18 v_arrayElimCell_175)) (.cse14 (select .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 .cse15)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 .cse15)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse16 .cse17)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse14 .cse17)))))) (or .cse19 (forall ((v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse17)))) (or .cse0 .cse20) (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse22 (+ v_arrayElimCell_176 4)) (.cse21 (select .cse23 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 .cse22)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse23 v_arrayElimCell_175) .cse22)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 .cse17)))))) .cse24 .cse9 (or .cse25 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse27 (+ v_arrayElimCell_176 4)) (.cse28 (select .cse26 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse26 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse27)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 .cse27)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 .cse17))))))) (or .cse11 .cse20)))))) is different from false [2022-11-02 20:42:49,551 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse54 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) v_arrayElimCell_175) (+ v_arrayElimCell_176 4))))) (.cse26 (not .cse2))) (let ((.cse13 (or (and .cse54 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse68 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 (+ v_arrayElimCell_176 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse68 (+ v_arrayElimCell_174 4))))))) .cse26)) (.cse14 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse66 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse65 (select .cse66 v_arrayElimCell_172)) (.cse67 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse65 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse66 v_arrayElimCell_175) .cse67)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse65 .cse67))))))) (.cse17 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse64 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse60 (select .cse64 v_arrayElimCell_172)) (.cse63 (+ v_arrayElimCell_176 4)) (.cse62 (select .cse64 v_arrayElimCell_175)) (.cse61 (+ v_arrayElimCell_174 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse61)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse62 .cse63)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse63)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse62 .cse61))))))) (.cse18 (or .cse2 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) v_arrayElimCell_172) (+ v_arrayElimCell_174 4)))))) (.cse23 (or .cse26 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse59 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse58 (+ v_arrayElimCell_176 4)) (.cse57 (select .cse59 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 .cse58)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 v_arrayElimCell_172) .cse58)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 (+ v_arrayElimCell_174 4))))))))) (.cse20 (or .cse26 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392)) (.cse56 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse55 v_arrayElimCell_175) .cse56)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse55 v_arrayElimCell_172) .cse56))))))) (.cse25 (or (and (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse53 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 (+ v_arrayElimCell_176 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 .cse4))))) .cse54) .cse26))) (let ((.cse0 (and (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse44 (select .cse46 v_arrayElimCell_175)) (.cse43 (select .cse46 v_arrayElimCell_172)) (.cse45 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse45)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 .cse45)))))) .cse20 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse47 (select .cse48 v_arrayElimCell_172)) (.cse49 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse48 v_arrayElimCell_175) .cse49)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse47 .cse49)))))) .cse25 (or .cse26 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse50 (select .cse52 v_arrayElimCell_175)) (.cse51 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 .cse51)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse52 v_arrayElimCell_172) .cse51))))))) (or .cse2 (forall ((v_arrayElimCell_172 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) v_arrayElimCell_172) .cse4)))))) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (or .cse26 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse42 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse40 (select .cse42 v_arrayElimCell_175)) (.cse41 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 .cse41)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse40 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse41)))))))) (.cse16 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse39 (+ v_arrayElimCell_176 4))) (or (= (select .cse37 (+ v_arrayElimCell_174 4)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse38 v_arrayElimCell_175) .cse39)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 .cse39))))))) (.cse21 (or .cse2 (forall ((v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_174 4)) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse22 (or (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392)) (.cse36 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 v_arrayElimCell_175) .cse36)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse35 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse36))))) .cse26)) (.cse1 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (and .cse13 .cse14 .cse17 .cse18 .cse20 .cse23)) (.cse24 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse32 (select .cse34 v_arrayElimCell_175)) (.cse31 (+ v_arrayElimCell_174 4)) (.cse30 (select .cse34 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse33 (+ v_arrayElimCell_176 4))) (or (= (select .cse30 .cse31) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 .cse33)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 .cse31)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse30 .cse33)))))))) (and (or .cse0 .cse1) (or .cse2 (forall ((v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse4)))) (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse6 (select .cse8 v_arrayElimCell_175)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse7 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse7)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 .cse7)))))) (or .cse0 .cse9) (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse12 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_arrayElimCell_175) .cse12)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 .cse12)))))) (or .cse1 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (or .cse9 .cse19) .cse20 .cse21 .cse22 .cse23 .cse24)) .cse22 .cse25 (or .cse26 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3392))) (let ((.cse27 (select .cse29 v_arrayElimCell_175)) (.cse28 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 .cse28)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse28))))))) (or .cse9 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 (or .cse1 .cse19) .cse23 .cse24))))))) is different from false [2022-11-02 20:42:54,690 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse17 (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse16 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse53 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392) v_arrayElimCell_175) (+ v_arrayElimCell_176 4))))) (.cse26 (not .cse17))) (let ((.cse1 (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392) v_arrayElimCell_172) (+ v_arrayElimCell_174 4)))) .cse17)) (.cse2 (or .cse26 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse68 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392))) (let ((.cse67 (+ v_arrayElimCell_176 4)) (.cse66 (select .cse68 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 .cse67)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse68 v_arrayElimCell_172) .cse67)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 (+ v_arrayElimCell_174 4))))))))) (.cse4 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse65 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392))) (let ((.cse62 (+ v_arrayElimCell_176 4)) (.cse63 (select .cse65 v_arrayElimCell_172)) (.cse61 (select .cse65 v_arrayElimCell_175)) (.cse64 (+ v_arrayElimCell_174 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse62)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 .cse62)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 .cse64)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse64))))))) (.cse5 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse58 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392))) (let ((.cse59 (+ v_arrayElimCell_176 4)) (.cse60 (select .cse58 v_arrayElimCell_172))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse58 v_arrayElimCell_175) .cse59)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse59)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 (+ v_arrayElimCell_174 4)))))))) (.cse6 (or (and (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse57 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392) v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 (+ v_arrayElimCell_176 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 (+ v_arrayElimCell_174 4)))))) .cse53) .cse26)) (.cse11 (or .cse26 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392)) (.cse56 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse55 v_arrayElimCell_175) .cse56)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse55 v_arrayElimCell_172) .cse56))))))) (.cse25 (or (and .cse53 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse54 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392) v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse54 (+ v_arrayElimCell_176 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse54 .cse16)))))) .cse26))) (let ((.cse14 (and (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse46 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392))) (let ((.cse45 (select .cse46 v_arrayElimCell_172)) (.cse44 (+ v_arrayElimCell_176 4)) (.cse43 (select .cse46 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 .cse44)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 .cse16)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 .cse44)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 .cse16)))))) .cse11 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392))) (let ((.cse49 (select .cse47 v_arrayElimCell_172)) (.cse48 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_175) .cse48)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 .cse16)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 .cse48)))))) (or .cse17 (forall ((v_arrayElimCell_172 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392) v_arrayElimCell_172) .cse16)))) (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392))) (let ((.cse51 (+ v_arrayElimCell_176 4)) (.cse50 (select .cse52 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 .cse51)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse52 v_arrayElimCell_172) .cse51)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 .cse16)))))) .cse26) .cse25)) (.cse12 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392))) (let ((.cse42 (select .cse40 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse41 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_arrayElimCell_175) .cse41)) (= (select .cse42 (+ v_arrayElimCell_174 4)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse42 .cse41))))))) (.cse7 (or .cse26 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392))) (let ((.cse38 (+ v_arrayElimCell_176 4)) (.cse37 (select .cse39 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 .cse38)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse39 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse38)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 (+ v_arrayElimCell_174 4))))))))) (.cse8 (or (forall ((v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_174 4)) |c_ULTIMATE.start_main_~data~0#1|)) .cse17)) (.cse9 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse36 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392))) (let ((.cse34 (select .cse36 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse33 (+ v_arrayElimCell_176 4)) (.cse32 (select .cse36 v_arrayElimCell_175)) (.cse35 (+ v_arrayElimCell_174 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 .cse33)) (= (select .cse34 .cse35) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 .cse33)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse32 .cse35))))))) (.cse10 (or .cse26 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392)) (.cse31 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 v_arrayElimCell_175) .cse31)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse30 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse31))))))) (.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse11))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or .cse12 .cse13))) (or .cse0 .cse14) (or (forall ((v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse16))) .cse17) (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392))) (let ((.cse20 (select .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse19 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse18 v_arrayElimCell_175) .cse19)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 .cse16)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse20 .cse19)))))) (or .cse12 .cse14) (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392))) (let ((.cse23 (select .cse24 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse22 (+ v_arrayElimCell_176 4)) (.cse21 (select .cse24 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 .cse22)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 .cse16)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse23 .cse22)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse21 .cse16)))))) .cse10 .cse25 (or .cse26 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) |c_ULTIMATE.start_sll_circular_prepend_#t~mem14#1.base| v_ArrVal_3392))) (let ((.cse28 (+ v_arrayElimCell_176 4)) (.cse27 (select .cse29 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 .cse28)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse28)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 .cse16))))))) (or .cse12 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or .cse0 .cse13)))))))) is different from false [2022-11-02 20:42:55,912 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (let ((.cse26 (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse60 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392) v_arrayElimCell_175) (+ v_arrayElimCell_176 4))))) (.cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse25 (not .cse26))) (let ((.cse20 (or (and .cse60 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse69 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392) v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse69 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse69 (+ v_arrayElimCell_176 4))))))) .cse25)) (.cse6 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse68 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392))) (let ((.cse64 (select .cse68 v_arrayElimCell_172)) (.cse66 (+ v_arrayElimCell_176 4)) (.cse67 (select .cse68 v_arrayElimCell_175)) (.cse65 (+ v_arrayElimCell_174 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse64 .cse65)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse64 .cse66)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse67 .cse66)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse67 .cse65))))))) (.cse9 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse63 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392))) (let ((.cse61 (select .cse63 v_arrayElimCell_172)) (.cse62 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse62)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse63 v_arrayElimCell_175) .cse62))))))) (.cse10 (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392) v_arrayElimCell_172) (+ v_arrayElimCell_174 4)))) .cse26)) (.cse11 (or (and (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse59 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392) v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 (+ v_arrayElimCell_176 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse59 (+ v_arrayElimCell_174 4)))))) .cse60) .cse25)) (.cse12 (or .cse25 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse56 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392))) (let ((.cse57 (+ v_arrayElimCell_176 4)) (.cse58 (select .cse56 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse56 v_arrayElimCell_172) .cse57)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse57)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 (+ v_arrayElimCell_174 4))))))))) (.cse18 (or .cse25 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse54 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392)) (.cse55 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse54 v_arrayElimCell_172) .cse55)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse54 v_arrayElimCell_175) .cse55)))))))) (let ((.cse7 (and .cse6 .cse9 .cse10 .cse11 .cse12 .cse18)) (.cse13 (or (forall ((v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_174 4)))) .cse26)) (.cse15 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392))) (let ((.cse51 (select .cse53 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse52 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 .cse52)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 v_arrayElimCell_175) .cse52))))))) (.cse16 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392))) (let ((.cse46 (select .cse50 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse47 (+ v_arrayElimCell_176 4)) (.cse49 (select .cse50 v_arrayElimCell_175)) (.cse48 (+ v_arrayElimCell_174 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse47)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse48)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 .cse47)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 .cse48))))))) (.cse17 (or .cse25 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392))) (let ((.cse44 (+ v_arrayElimCell_176 4)) (.cse45 (select .cse43 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse44)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 .cse44)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 (+ v_arrayElimCell_174 4))))))))) (.cse14 (or (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392)) (.cse42 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse41 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse42)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse41 v_arrayElimCell_175) .cse42))))) .cse25)) (.cse19 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse21 (and (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392))) (let ((.cse33 (select .cse31 v_arrayElimCell_175)) (.cse32 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse31 v_arrayElimCell_172) .cse32)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse32)))))) .cse25) (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392))) (let ((.cse34 (select .cse37 v_arrayElimCell_172)) (.cse36 (select .cse37 v_arrayElimCell_175)) (.cse35 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 .cse35)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 .cse35)))))) .cse20 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392))) (let ((.cse38 (select .cse40 v_arrayElimCell_172)) (.cse39 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 .cse39)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_arrayElimCell_175) .cse39)))))) (or .cse26 (forall ((v_arrayElimCell_172 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392) v_arrayElimCell_172) .cse1)))) .cse18))) (and (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse2 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse3 v_arrayElimCell_175) .cse2)))))) (or (and .cse6 (or .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19) (or (and .cse6 .cse9 .cse10 .cse11 .cse12 (or .cse19 .cse7) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse8) .cse20 .cse14 (or .cse19 .cse21) (or (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392))) (let ((.cse24 (select .cse22 v_arrayElimCell_175)) (.cse23 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse23)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 .cse23)))))) .cse25) (or .cse26 (forall ((v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse1)))) (or .cse8 .cse21) (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse5 v_ArrVal_3392))) (let ((.cse27 (select .cse30 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse29 (select .cse30 v_arrayElimCell_175)) (.cse28 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 .cse28)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse28)))))))))))) is different from false [2022-11-02 20:42:59,777 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|))) (let ((.cse23 (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse56 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392) v_arrayElimCell_175) (+ v_arrayElimCell_176 4))))) (.cse30 (not .cse23))) (let ((.cse11 (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse69 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392))) (let ((.cse68 (+ v_arrayElimCell_176 4)) (.cse67 (select .cse69 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse67 .cse68)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse69 v_arrayElimCell_172) .cse68)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse67 (+ v_arrayElimCell_174 4))))))) .cse30)) (.cse12 (or .cse23 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392) v_arrayElimCell_172) (+ v_arrayElimCell_174 4)))))) (.cse14 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse64 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392))) (let ((.cse66 (select .cse64 v_arrayElimCell_172)) (.cse65 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse64 v_arrayElimCell_175) .cse65)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 .cse65))))))) (.cse16 (or (and (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse63 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392) v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 (+ v_arrayElimCell_176 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 (+ v_arrayElimCell_174 4)))))) .cse56) .cse30)) (.cse18 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse62 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392))) (let ((.cse60 (select .cse62 v_arrayElimCell_172)) (.cse59 (+ v_arrayElimCell_176 4)) (.cse58 (select .cse62 v_arrayElimCell_175)) (.cse61 (+ v_arrayElimCell_174 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse59)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse61)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse60 .cse59)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse61))))))) (.cse22 (or (and .cse56 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse57 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392) v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 (+ v_arrayElimCell_176 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 .cse1)))))) .cse30)) (.cse13 (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse54 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392)) (.cse55 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse54 v_arrayElimCell_175) .cse55)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse54 v_arrayElimCell_172) .cse55))))) .cse30))) (let ((.cse7 (and .cse22 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392))) (let ((.cse44 (select .cse47 v_arrayElimCell_175)) (.cse46 (select .cse47 v_arrayElimCell_172)) (.cse45 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse45)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse44 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse45)))))) .cse13 (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392))) (let ((.cse48 (select .cse50 v_arrayElimCell_175)) (.cse49 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 .cse49)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse48 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse50 v_arrayElimCell_172) .cse49)))))) .cse30) (or .cse23 (forall ((v_arrayElimCell_172 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392) v_arrayElimCell_172) .cse1)))) (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse51 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392))) (let ((.cse53 (select .cse51 v_arrayElimCell_172)) (.cse52 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse51 v_arrayElimCell_175) .cse52)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse53 .cse52)))))))) (.cse10 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392))) (let ((.cse42 (+ v_arrayElimCell_176 4)) (.cse43 (select .cse41 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse41 v_arrayElimCell_175) .cse42)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 .cse42)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 (+ v_arrayElimCell_174 4)))))))) (.cse21 (and .cse11 .cse12 .cse13 .cse14 .cse16 .cse18)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (or (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392))) (let ((.cse39 (+ v_arrayElimCell_176 4)) (.cse38 (select .cse40 v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 .cse39)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse39)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 (+ v_arrayElimCell_174 4))))))) .cse30)) (.cse17 (or .cse23 (forall ((v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_174 4)))))) (.cse19 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392))) (let ((.cse34 (+ v_arrayElimCell_176 4)) (.cse35 (select .cse37 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse33 (select .cse37 v_arrayElimCell_175)) (.cse36 (+ v_arrayElimCell_174 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse34)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 .cse34)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse35 .cse36)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse36))))))) (.cse20 (or (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392)) (.cse32 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse31 v_arrayElimCell_175) .cse32)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse31 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse32))))) .cse30)) (.cse8 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392))) (let ((.cse2 (select .cse4 v_arrayElimCell_175)) (.cse0 (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse3 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 .cse3)))))) (or .cse7 .cse8) (or .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (or .cse8 .cse21))) .cse22 (or .cse7 .cse9) (or .cse23 (forall ((v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse1)))) (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse26 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse25 v_arrayElimCell_175) .cse26)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse24 .cse26)))))) (or (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse6 v_ArrVal_3392))) (let ((.cse27 (select .cse29 v_arrayElimCell_175)) (.cse28 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 .cse28)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse27 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse28)))))) .cse30) .cse20 (or (and .cse10 .cse11 (or .cse21 .cse9) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse8))))))) is different from false [2022-11-02 20:43:00,947 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (let ((.cse3 (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse54 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392) v_arrayElimCell_175) (+ v_arrayElimCell_176 4)) |c_ULTIMATE.start_main_~data~0#1|))) (.cse2 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse11 (not .cse3))) (let ((.cse30 (or (and .cse54 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse69 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392) v_arrayElimCell_175))) (or (= (select .cse69 (+ v_arrayElimCell_176 4)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse69 .cse2)))))) .cse11)) (.cse16 (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse68 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392))) (let ((.cse66 (select .cse68 v_arrayElimCell_175)) (.cse67 (+ v_arrayElimCell_176 4))) (or (= (select .cse66 .cse67) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse66 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse68 v_arrayElimCell_172) .cse67)))))) .cse11)) (.cse18 (or .cse11 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse64 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392)) (.cse65 (+ v_arrayElimCell_176 4))) (or (= (select (select .cse64 v_arrayElimCell_175) .cse65) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse64 v_arrayElimCell_172) .cse65))))))) (.cse19 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse61 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392))) (let ((.cse63 (select .cse61 v_arrayElimCell_172)) (.cse62 (+ v_arrayElimCell_176 4))) (or (= (select (select .cse61 v_arrayElimCell_175) .cse62) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse63 .cse62))))))) (.cse20 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse60 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392))) (let ((.cse56 (select .cse60 v_arrayElimCell_175)) (.cse59 (+ v_arrayElimCell_174 4)) (.cse58 (select .cse60 v_arrayElimCell_172)) (.cse57 (+ v_arrayElimCell_176 4))) (or (= (select .cse56 .cse57) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse59)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse56 .cse59)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse58 .cse57))))))) (.cse23 (or .cse3 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392) v_arrayElimCell_172) (+ v_arrayElimCell_174 4)))))) (.cse24 (or .cse11 (and .cse54 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse55 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392) v_arrayElimCell_175))) (or (= (select .cse55 (+ v_arrayElimCell_176 4)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse55 (+ v_arrayElimCell_174 4)))))))))) (let ((.cse14 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (or .cse11 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392))) (let ((.cse51 (select .cse53 v_arrayElimCell_175)) (.cse52 (+ v_arrayElimCell_176 4))) (or (= (select .cse51 .cse52) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse51 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse53 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse52)))))))) (.cse13 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392))) (let ((.cse50 (select .cse48 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse49 (+ v_arrayElimCell_176 4))) (or (= (select (select .cse48 v_arrayElimCell_175) .cse49) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse50 .cse49))))))) (.cse15 (and .cse16 .cse18 .cse19 .cse20 .cse23 .cse24)) (.cse17 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392))) (let ((.cse43 (select .cse47 v_arrayElimCell_175)) (.cse46 (+ v_arrayElimCell_174 4)) (.cse45 (select .cse47 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse44 (+ v_arrayElimCell_176 4))) (or (= (select .cse43 .cse44) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 .cse46)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse43 .cse46)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse45 .cse44))))))) (.cse21 (or .cse3 (forall ((v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_174 4)))))) (.cse22 (or .cse11 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse41 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392)) (.cse42 (+ v_arrayElimCell_176 4))) (or (= (select (select .cse41 v_arrayElimCell_175) .cse42) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse41 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse42))))))) (.cse25 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse26 (and (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392))) (let ((.cse33 (select .cse31 v_arrayElimCell_172)) (.cse32 (+ v_arrayElimCell_176 4))) (or (= (select (select .cse31 v_arrayElimCell_175) .cse32) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse33 .cse32)))))) (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse37 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392))) (let ((.cse34 (select .cse37 v_arrayElimCell_175)) (.cse36 (select .cse37 v_arrayElimCell_172)) (.cse35 (+ v_arrayElimCell_176 4))) (or (= (select .cse34 .cse35) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse34 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 .cse35)))))) .cse18 (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392))) (let ((.cse38 (select .cse40 v_arrayElimCell_175)) (.cse39 (+ v_arrayElimCell_176 4))) (or (= (select .cse38 .cse39) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse38 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse40 v_arrayElimCell_172) .cse39)))))) .cse11) .cse30 (or (forall ((v_arrayElimCell_172 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392) v_arrayElimCell_172) .cse2))) .cse3)))) (and (or (forall ((v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse2))) .cse3) (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392))) (let ((.cse4 (select .cse7 v_arrayElimCell_175)) (.cse6 (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse5 (+ v_arrayElimCell_176 4))) (or (= (select .cse4 .cse5) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse4 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse5)))))) (or (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392))) (let ((.cse8 (select .cse10 v_arrayElimCell_175)) (.cse9 (+ v_arrayElimCell_176 4))) (or (= (select .cse8 .cse9) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse9)))))) .cse11) (or (and .cse12 .cse13 (or .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25) (or .cse14 .cse26) (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse1 v_ArrVal_3392))) (let ((.cse29 (select .cse27 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse28 (+ v_arrayElimCell_176 4))) (or (= (select (select .cse27 v_arrayElimCell_175) .cse28) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse29 .cse28)))))) .cse30 .cse22 (or .cse14 (and .cse12 .cse13 (or .cse25 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)) (or .cse25 .cse26))))))) is different from false [2022-11-02 20:43:03,984 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (let ((.cse26 (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4)) (.cse63 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392) v_arrayElimCell_175) (+ v_arrayElimCell_176 4))))) (.cse27 (not .cse26))) (let ((.cse0 (or (and (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse69 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392) v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse69 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse69 (+ v_arrayElimCell_176 4)))))) .cse63) .cse27)) (.cse11 (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse67 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392)) (.cse68 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_arrayElimCell_172) .cse68)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse67 v_arrayElimCell_175) .cse68))))) .cse27)) (.cse12 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse66 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392))) (let ((.cse64 (select .cse66 v_arrayElimCell_172)) (.cse65 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse64 .cse65)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse64 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse66 v_arrayElimCell_175) .cse65))))))) (.cse13 (or (and (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse62 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392) v_arrayElimCell_175))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse62 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse62 (+ v_arrayElimCell_176 4)))))) .cse63) .cse27)) (.cse14 (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse59 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392))) (let ((.cse61 (select .cse59 v_arrayElimCell_175)) (.cse60 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse59 v_arrayElimCell_172) .cse60)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse61 .cse60)))))) .cse27)) (.cse15 (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392) v_arrayElimCell_172) (+ v_arrayElimCell_174 4)))) .cse26)) (.cse21 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse58 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392))) (let ((.cse54 (select .cse58 v_arrayElimCell_172)) (.cse56 (+ v_arrayElimCell_174 4)) (.cse57 (select .cse58 v_arrayElimCell_175)) (.cse55 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse54 .cse55)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse54 .cse56)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 .cse56)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse57 .cse55)))))))) (let ((.cse10 (or .cse26 (forall ((v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ v_arrayElimCell_174 4)))))) (.cse18 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse21)) (.cse16 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392))) (let ((.cse49 (select .cse53 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse50 (+ v_arrayElimCell_174 4)) (.cse52 (select .cse53 v_arrayElimCell_175)) (.cse51 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 .cse50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse49 .cse51)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 .cse50)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse52 .cse51))))))) (.cse8 (or (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392)) (.cse48 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse48)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse47 v_arrayElimCell_175) .cse48))))) .cse27)) (.cse19 (or (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392))) (let ((.cse46 (select .cse44 v_arrayElimCell_175)) (.cse45 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse44 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse45)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse46 .cse45)))))) .cse27)) (.cse20 (forall ((v_arrayElimCell_175 Int) (v_arrayElimCell_174 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392))) (let ((.cse41 (select .cse43 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse42 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 (+ v_arrayElimCell_174 4))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse41 .cse42)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse43 v_arrayElimCell_175) .cse42))))))) (.cse17 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse25 (and .cse11 .cse0 (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392))) (let ((.cse31 (select .cse33 v_arrayElimCell_172)) (.cse32 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse31 .cse32)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse33 v_arrayElimCell_175) .cse32)))))) (or (forall ((v_arrayElimCell_172 Int) (v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392) v_arrayElimCell_172) .cse2))) .cse26) (or (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392))) (let ((.cse36 (select .cse34 v_arrayElimCell_175)) (.cse35 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse34 v_arrayElimCell_172) .cse35)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse36 .cse35)))))) .cse27) (forall ((v_arrayElimCell_172 Int) (v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse40 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392))) (let ((.cse37 (select .cse40 v_arrayElimCell_172)) (.cse39 (select .cse40 v_arrayElimCell_175)) (.cse38 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse37 .cse38)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse39 .cse38))))))))) (and .cse0 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse3 (select .cse5 v_arrayElimCell_175)) (.cse4 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse1 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse3 .cse4)))))) .cse8 (or .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (or .cse17 .cse18) .cse8 .cse19 .cse20 .cse21)) (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse23 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse22 .cse23)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse24 v_arrayElimCell_175) .cse23)))))) (or (and .cse10 .cse11 (or .cse18 .cse9) .cse12 .cse13 .cse14 .cse15 .cse16 .cse8 .cse19 .cse20 .cse21) .cse17) (or .cse17 .cse25) (or (forall ((v_ArrVal_3388 (Array Int Int)) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse2))) .cse26) (or .cse27 (forall ((v_arrayElimCell_175 Int) (v_ArrVal_3388 (Array Int Int)) (v_arrayElimCell_176 Int) (v_ArrVal_3385 Int) (v_ArrVal_3392 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| v_ArrVal_3385)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3388) .cse7 v_ArrVal_3392))) (let ((.cse28 (select .cse29 v_arrayElimCell_175)) (.cse30 (+ v_arrayElimCell_176 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse30)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse28 .cse30))))))) (or .cse9 .cse25))))))) is different from false [2022-11-02 20:43:51,456 WARN L234 SmtUtils]: Spent 46.68s on a formula simplification that was a NOOP. DAG size: 537 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-02 20:43:51,456 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:43:51,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 59 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 59 new quantified variables, introduced 118 case distinctions, treesize of input 7700 treesize of output 22368 [2022-11-02 20:44:03,484 WARN L234 SmtUtils]: Spent 12.01s on a formula simplification. DAG size of input: 6624 DAG size of output: 6623 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:44:16,576 WARN L234 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 6385 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:44:24,117 WARN L234 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 6232 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)