./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_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_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:53:37,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:53:37,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:53:37,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:53:37,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:53:37,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:53:37,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:53:37,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:53:37,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:53:37,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:53:37,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:53:37,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:53:37,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:53:37,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:53:37,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:53:37,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:53:37,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:53:37,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:53:37,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:53:37,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:53:37,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:53:37,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:53:37,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:53:37,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:53:37,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:53:37,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:53:37,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:53:37,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:53:37,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:53:37,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:53:37,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:53:37,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:53:37,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:53:37,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:53:37,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:53:37,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:53:37,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:53:37,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:53:37,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:53:37,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:53:37,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:53:37,908 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 01:53:37,949 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:53:37,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:53:37,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:53:37,950 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:53:37,951 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:53:37,951 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:53:37,951 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:53:37,951 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:53:37,952 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:53:37,952 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:53:37,953 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:53:37,953 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:53:37,953 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:53:37,954 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:53:37,954 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:53:37,954 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:53:37,954 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:53:37,954 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:53:37,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 01:53:37,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 01:53:37,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:53:37,956 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:53:37,956 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:53:37,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:53:37,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:53:37,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:53:37,957 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 01:53:37,957 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 01:53:37,957 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 01:53:37,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:53:37,958 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:53:37,958 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:53:37,958 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:53:37,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:53:37,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:53:37,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:53:37,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:53:37,961 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:53:37,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:53:37,961 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:53:37,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:53:37,961 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:53:37,962 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_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2022-11-03 01:53:38,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:53:38,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:53:38,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:53:38,339 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:53:38,339 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:53:38,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-11-03 01:53:38,418 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/data/977a3371b/82ee4530775440c3a90902b6b8f8eda7/FLAG43900effe [2022-11-03 01:53:39,039 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:53:39,040 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-11-03 01:53:39,052 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/data/977a3371b/82ee4530775440c3a90902b6b8f8eda7/FLAG43900effe [2022-11-03 01:53:39,334 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/data/977a3371b/82ee4530775440c3a90902b6b8f8eda7 [2022-11-03 01:53:39,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:53:39,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:53:39,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:53:39,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:53:39,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:53:39,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:39,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4477e14b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39, skipping insertion in model container [2022-11-03 01:53:39,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:39,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:53:39,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:53:39,839 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_bf9ec891-c68c-4384-80d5-bbf0d6488d33/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-11-03 01:53:39,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:53:39,853 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:53:39,919 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_bf9ec891-c68c-4384-80d5-bbf0d6488d33/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-11-03 01:53:39,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:53:39,954 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:53:39,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39 WrapperNode [2022-11-03 01:53:39,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:53:39,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:53:39,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:53:39,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:53:39,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:39,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:40,034 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 160 [2022-11-03 01:53:40,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:53:40,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:53:40,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:53:40,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:53:40,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:40,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:40,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:40,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:40,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:40,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:40,091 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:40,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:40,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:53:40,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:53:40,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:53:40,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:53:40,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39" (1/1) ... [2022-11-03 01:53:40,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:53:40,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:40,142 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:53:40,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:53:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:53:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:53:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-03 01:53:40,192 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-03 01:53:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:53:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:53:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:53:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 01:53:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 01:53:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:53:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 01:53:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:53:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:53:40,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:53:40,410 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:53:40,413 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:53:40,869 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:53:40,935 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:53:40,941 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 01:53:40,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:53:40 BoogieIcfgContainer [2022-11-03 01:53:40,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:53:40,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:53:40,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:53:40,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:53:40,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:53:39" (1/3) ... [2022-11-03 01:53:40,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ab76ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:53:40, skipping insertion in model container [2022-11-03 01:53:40,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:39" (2/3) ... [2022-11-03 01:53:40,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ab76ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:53:40, skipping insertion in model container [2022-11-03 01:53:40,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:53:40" (3/3) ... [2022-11-03 01:53:40,956 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2022-11-03 01:53:40,974 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:53:40,975 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-11-03 01:53:41,058 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:53:41,075 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;@6b36d997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:53:41,076 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-11-03 01:53:41,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 60 states have (on average 2.4) internal successors, (144), 132 states have internal predecessors, (144), 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-03 01:53:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 01:53:41,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:41,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 01:53:41,095 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:53:41,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash 264846151, now seen corresponding path program 1 times [2022-11-03 01:53:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:41,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444253092] [2022-11-03 01:53:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:41,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:41,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:41,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444253092] [2022-11-03 01:53:41,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444253092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:41,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:41,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:53:41,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486100488] [2022-11-03 01:53:41,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:41,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:41,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:41,470 INFO L87 Difference]: Start difference. First operand has 137 states, 60 states have (on average 2.4) internal successors, (144), 132 states have internal predecessors, (144), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:41,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:41,735 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-11-03 01:53:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:41,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2022-11-03 01:53:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:41,754 INFO L225 Difference]: With dead ends: 134 [2022-11-03 01:53:41,754 INFO L226 Difference]: Without dead ends: 132 [2022-11-03 01:53:41,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:41,760 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 8 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:41,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 189 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-03 01:53:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-03 01:53:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 59 states have (on average 2.305084745762712) internal successors, (136), 127 states have internal predecessors, (136), 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-03 01:53:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2022-11-03 01:53:41,828 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 5 [2022-11-03 01:53:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:41,828 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2022-11-03 01:53:41,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-11-03 01:53:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 01:53:41,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:41,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 01:53:41,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:53:41,830 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:53:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:41,830 INFO L85 PathProgramCache]: Analyzing trace with hash 264846150, now seen corresponding path program 1 times [2022-11-03 01:53:41,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:41,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194361821] [2022-11-03 01:53:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:41,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:41,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194361821] [2022-11-03 01:53:41,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194361821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:41,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:41,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:53:41,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825314623] [2022-11-03 01:53:41,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:41,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:41,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:41,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:41,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:41,952 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:42,102 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-11-03 01:53:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:42,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2022-11-03 01:53:42,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:42,110 INFO L225 Difference]: With dead ends: 129 [2022-11-03 01:53:42,110 INFO L226 Difference]: Without dead ends: 129 [2022-11-03 01:53:42,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:42,115 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:42,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 182 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-03 01:53:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-03 01:53:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 59 states have (on average 2.2542372881355934) internal successors, (133), 124 states have internal predecessors, (133), 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-03 01:53:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2022-11-03 01:53:42,122 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 5 [2022-11-03 01:53:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:42,123 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2022-11-03 01:53:42,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2022-11-03 01:53:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:53:42,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:42,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:42,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:53:42,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:53:42,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:42,127 INFO L85 PathProgramCache]: Analyzing trace with hash 883355377, now seen corresponding path program 1 times [2022-11-03 01:53:42,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:42,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642452376] [2022-11-03 01:53:42,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:42,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:42,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642452376] [2022-11-03 01:53:42,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642452376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:42,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:42,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:53:42,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003950979] [2022-11-03 01:53:42,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:42,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:42,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:42,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:42,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:42,303 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:53:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:42,377 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2022-11-03 01:53:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2022-11-03 01:53:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:42,379 INFO L225 Difference]: With dead ends: 140 [2022-11-03 01:53:42,379 INFO L226 Difference]: Without dead ends: 140 [2022-11-03 01:53:42,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:42,380 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:42,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 239 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-03 01:53:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2022-11-03 01:53:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 60 states have (on average 2.2333333333333334) internal successors, (134), 125 states have internal predecessors, (134), 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-03 01:53:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2022-11-03 01:53:42,390 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 11 [2022-11-03 01:53:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:42,390 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2022-11-03 01:53:42,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-03 01:53:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2022-11-03 01:53:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:53:42,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:42,391 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:42,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:53:42,392 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:53:42,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash 162987860, now seen corresponding path program 1 times [2022-11-03 01:53:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:42,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136039388] [2022-11-03 01:53:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:53:42,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:42,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136039388] [2022-11-03 01:53:42,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136039388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:42,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:42,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:53:42,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070116254] [2022-11-03 01:53:42,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:42,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:53:42,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:42,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:53:42,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:42,567 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-03 01:53:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:42,878 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-11-03 01:53:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:53:42,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 19 [2022-11-03 01:53:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:42,881 INFO L225 Difference]: With dead ends: 130 [2022-11-03 01:53:42,881 INFO L226 Difference]: Without dead ends: 130 [2022-11-03 01:53:42,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:53:42,883 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 18 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:42,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 346 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:53:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-03 01:53:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-03 01:53:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 60 states have (on average 2.216666666666667) internal successors, (133), 124 states have internal predecessors, (133), 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-03 01:53:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2022-11-03 01:53:42,895 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 19 [2022-11-03 01:53:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:42,896 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2022-11-03 01:53:42,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-03 01:53:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2022-11-03 01:53:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:53:42,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:42,897 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:42,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:53:42,897 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:53:42,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:42,898 INFO L85 PathProgramCache]: Analyzing trace with hash 162987861, now seen corresponding path program 1 times [2022-11-03 01:53:42,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:42,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132431280] [2022-11-03 01:53:42,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:53:43,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:43,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132431280] [2022-11-03 01:53:43,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132431280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:43,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:43,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:53:43,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263492374] [2022-11-03 01:53:43,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:43,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:53:43,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:43,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:53:43,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:43,204 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-03 01:53:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:43,489 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2022-11-03 01:53:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:53:43,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2022-11-03 01:53:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:43,490 INFO L225 Difference]: With dead ends: 129 [2022-11-03 01:53:43,490 INFO L226 Difference]: Without dead ends: 129 [2022-11-03 01:53:43,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:53:43,492 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 16 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:43,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 370 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:53:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-03 01:53:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-11-03 01:53:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 60 states have (on average 2.2) internal successors, (132), 123 states have internal predecessors, (132), 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-03 01:53:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-11-03 01:53:43,499 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 19 [2022-11-03 01:53:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:43,500 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-11-03 01:53:43,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-03 01:53:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-11-03 01:53:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 01:53:43,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:43,501 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:43,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:53:43,501 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:53:43,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2012510517, now seen corresponding path program 1 times [2022-11-03 01:53:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:43,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046586934] [2022-11-03 01:53:43,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:43,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:43,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046586934] [2022-11-03 01:53:43,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046586934] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:43,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574112384] [2022-11-03 01:53:43,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:43,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:43,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:43,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:43,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:53:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:43,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 01:53:43,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:43,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:53:44,093 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-11-03 01:53:44,094 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 14 treesize of output 13 [2022-11-03 01:53:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:44,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:44,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574112384] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:44,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [513928775] [2022-11-03 01:53:44,494 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 01:53:44,494 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:44,498 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:53:44,503 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:53:44,504 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:53:44,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:53:44,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:53:44,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:53:44,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:53:44,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:53:44,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:53:44,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:53:44,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:44,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:53:44,724 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 19 treesize of output 1 [2022-11-03 01:53:44,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:53:44,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:53:44,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 13 treesize of output 9 [2022-11-03 01:53:44,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:53:44,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:53:44,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:44,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:53:45,211 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:53:45,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:53:45,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:53:45,529 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:53:45,544 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:53:45,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:53:45,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:53:45,603 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:53:45,605 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:53:45,733 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:53:45,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:53:46,031 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:53:46,050 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:53:46,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:53:46,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:53:46,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:53:46,107 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:53:46,109 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:53:46,112 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:53:46,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 01:53:46,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:53:46,229 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:53:46,378 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:53:46,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:53:46,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:46,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:46,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:53:46,563 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 90 for LOIs [2022-11-03 01:53:47,055 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:53:55,893 WARN L234 SmtUtils]: Spent 6.67s on a formula simplification. DAG size of input: 130 DAG size of output: 119 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:54:03,479 WARN L234 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 143 DAG size of output: 131 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:54:04,966 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1613#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select |ULTIMATE.start_main_old_#valid#1| 1) 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |ULTIMATE.start_main_old_#valid#1| 2) 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_dll_circular_create_~data#1|) (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#s~0#1.base|) 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (< |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (not (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 01:54:04,966 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:54:04,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:04,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2022-11-03 01:54:04,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352125895] [2022-11-03 01:54:04,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:04,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 01:54:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:04,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 01:54:04,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2022-11-03 01:54:04,971 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 01:54:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:05,555 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-11-03 01:54:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:54:05,555 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2022-11-03 01:54:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:05,559 INFO L225 Difference]: With dead ends: 152 [2022-11-03 01:54:05,559 INFO L226 Difference]: Without dead ends: 152 [2022-11-03 01:54:05,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2022-11-03 01:54:05,561 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 464 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:05,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 573 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 611 Invalid, 0 Unknown, 228 Unchecked, 0.5s Time] [2022-11-03 01:54:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-03 01:54:05,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 133. [2022-11-03 01:54:05,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 64 states have (on average 2.15625) internal successors, (138), 127 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:54:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2022-11-03 01:54:05,578 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 21 [2022-11-03 01:54:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:05,579 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2022-11-03 01:54:05,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 01:54:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2022-11-03 01:54:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 01:54:05,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:05,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:05,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 01:54:05,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:05,789 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:54:05,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:05,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2012510518, now seen corresponding path program 1 times [2022-11-03 01:54:05,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:05,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395907081] [2022-11-03 01:54:05,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:05,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:06,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:06,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395907081] [2022-11-03 01:54:06,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395907081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:06,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760742270] [2022-11-03 01:54:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:06,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:06,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:06,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:06,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:54:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:06,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 01:54:06,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:06,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:54:06,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:54:06,649 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:54:06,650 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-03 01:54:06,656 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 14 treesize of output 9 [2022-11-03 01:54:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:06,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:10,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760742270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:10,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [54814426] [2022-11-03 01:54:10,953 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-03 01:54:10,953 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:54:10,953 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:54:10,953 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:54:10,953 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:54:10,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:10,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:10,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:54:10,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:54:11,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:54:11,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:54:11,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:54:11,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:54:11,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:54:11,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:54:11,056 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 19 treesize of output 1 [2022-11-03 01:54:11,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:54:11,073 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 13 treesize of output 9 [2022-11-03 01:54:11,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:54:11,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:54:11,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:54:11,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:54:11,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:54:11,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,255 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:54:11,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:54:11,295 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:11,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:11,339 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:11,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:11,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:54:11,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,398 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:54:11,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:54:11,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:54:11,450 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:11,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:11,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:11,484 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:11,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:54:11,569 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:54:11,588 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 23 treesize of output 11 [2022-11-03 01:54:11,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,644 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:54:11,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:54:11,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:11,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:54:11,686 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 94 for LOIs [2022-11-03 01:54:12,144 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:54:21,339 WARN L234 SmtUtils]: Spent 6.93s on a formula simplification. DAG size of input: 134 DAG size of output: 122 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:54:29,368 WARN L234 SmtUtils]: Spent 7.83s on a formula simplification. DAG size of input: 147 DAG size of output: 135 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:54:30,673 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2007#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= (select |ULTIMATE.start_main_old_#valid#1| 1) 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |ULTIMATE.start_main_old_#valid#1| 2) 1) (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~data#1| |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_main_~len~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |ULTIMATE.start_dll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_#in~len#1| |ULTIMATE.start_dll_circular_create_~len#1|) (< (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8) |ULTIMATE.start_dll_circular_create_~data#1|) (= (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~#s~0#1.base|) 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 12) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (< |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 01:54:30,674 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:54:30,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:54:30,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-11-03 01:54:30,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008092372] [2022-11-03 01:54:30,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:30,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 01:54:30,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 01:54:30,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2022-11-03 01:54:30,676 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 01:54:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:31,554 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2022-11-03 01:54:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:54:31,555 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2022-11-03 01:54:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:31,556 INFO L225 Difference]: With dead ends: 135 [2022-11-03 01:54:31,556 INFO L226 Difference]: Without dead ends: 135 [2022-11-03 01:54:31,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 01:54:31,557 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 13 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:31,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 598 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:54:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-03 01:54:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-11-03 01:54:31,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 64 states have (on average 2.140625) internal successors, (137), 127 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:54:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-11-03 01:54:31,564 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 21 [2022-11-03 01:54:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:31,565 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-11-03 01:54:31,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 01:54:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-11-03 01:54:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:54:31,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:31,569 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:31,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:31,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:31,785 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:54:31,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:31,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1287485459, now seen corresponding path program 1 times [2022-11-03 01:54:31,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:31,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958942568] [2022-11-03 01:54:31,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:31,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:54:31,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:31,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958942568] [2022-11-03 01:54:31,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958942568] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:31,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967717777] [2022-11-03 01:54:31,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:31,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:31,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:31,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:31,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:54:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:32,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:54:32,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:54:32,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:54:32,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967717777] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:32,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1701680412] [2022-11-03 01:54:32,079 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 01:54:32,079 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:54:32,079 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:54:32,079 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:54:32,080 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:54:32,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:54:32,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:54:32,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:54:32,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:54:32,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:54:32,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:54:32,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:54:32,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:54:32,192 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 19 treesize of output 1 [2022-11-03 01:54:32,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:54:32,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:54:32,235 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 13 treesize of output 9 [2022-11-03 01:54:32,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:54:32,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:54:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:54:32,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:32,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:54:32,480 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:54:32,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:54:32,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:32,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:54:32,720 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:32,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:32,742 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:32,756 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:54:32,759 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:54:32,844 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:54:32,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:54:33,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:33,100 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:54:33,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:54:33,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:33,123 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:54:33,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:33,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:54:33,156 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:54:33,158 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:54:33,160 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:54:33,162 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:54:33,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:54:33,239 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 23 treesize of output 11 [2022-11-03 01:54:33,250 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:54:33,361 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:54:33,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:54:33,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:54:33,610 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:33,621 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:33,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:33,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:33,656 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:54:33,658 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:54:33,660 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:54:33,745 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:54:33,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:54:33,972 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:33,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:54:33,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:34,009 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:34,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:34,035 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:54:34,038 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:54:34,040 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:54:34,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:34,217 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 01:54:34,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:34,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:34,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:34,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 01:54:34,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:34,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:34,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:34,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 01:54:34,394 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:54:34,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:54:34,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:34,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:34,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:54:34,657 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 90 for LOIs [2022-11-03 01:54:35,062 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:54:44,833 WARN L234 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 130 DAG size of output: 120 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:54:53,411 WARN L234 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 143 DAG size of output: 133 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:54:55,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1701680412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:54:55,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:55,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6, 6] total 17 [2022-11-03 01:54:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112878188] [2022-11-03 01:54:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:54:55,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:54:55,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:54:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:54:55,471 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 01:54:56,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:56,859 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2022-11-03 01:54:56,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 01:54:56,860 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-11-03 01:54:56,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:56,861 INFO L225 Difference]: With dead ends: 139 [2022-11-03 01:54:56,861 INFO L226 Difference]: Without dead ends: 139 [2022-11-03 01:54:56,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:54:56,862 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 536 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:56,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 356 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 684 Invalid, 0 Unknown, 536 Unchecked, 1.4s Time] [2022-11-03 01:54:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-03 01:54:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-11-03 01:54:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 69 states have (on average 2.0434782608695654) internal successors, (141), 132 states have internal predecessors, (141), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:54:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2022-11-03 01:54:56,880 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 23 [2022-11-03 01:54:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:56,880 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2022-11-03 01:54:56,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 01:54:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2022-11-03 01:54:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:54:56,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:56,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:56,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:57,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-03 01:54:57,109 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:54:57,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:57,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1252332262, now seen corresponding path program 1 times [2022-11-03 01:54:57,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:57,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367574487] [2022-11-03 01:54:57,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:54:57,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:57,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367574487] [2022-11-03 01:54:57,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367574487] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:57,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417754326] [2022-11-03 01:54:57,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:57,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:57,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:57,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:57,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:54:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:57,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:54:57,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:54:57,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:57,417 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-03 01:54:57,421 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-03 01:54:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:54:57,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417754326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:57,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [356428106] [2022-11-03 01:54:57,453 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 01:54:57,454 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:54:57,454 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:54:57,454 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:54:57,455 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:54:57,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:54:57,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:54:57,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:54:57,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:54:57,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:54:57,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:54:57,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:54:57,573 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 19 treesize of output 1 [2022-11-03 01:54:57,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:54:57,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:54:57,597 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 13 treesize of output 9 [2022-11-03 01:54:57,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:54:57,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:54:57,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:54:57,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:54:57,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:54:57,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,793 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:54:57,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:54:57,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:54:57,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:57,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:57,869 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:57,884 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:57,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:57,928 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:54:57,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:54:57,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:57,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:57,995 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:58,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:54:58,025 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:58,090 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 23 treesize of output 11 [2022-11-03 01:54:58,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:54:58,121 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:54:58,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,200 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:54:58,201 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 01:54:58,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,233 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:54:58,233 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:54:58,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:58,254 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 27 treesize of output 11 [2022-11-03 01:54:58,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:58,312 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 27 treesize of output 11 [2022-11-03 01:54:58,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,343 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:54:58,343 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 01:54:58,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,378 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:54:58,379 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:54:58,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:58,515 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:54:58,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:54:58,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:58,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:54:58,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:58,593 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:58,604 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:58,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:58,641 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:54:58,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:54:58,683 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:58,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:54:58,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:58,716 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:54:58,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:54:58,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:54:58,836 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:54:58,855 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 23 treesize of output 11 [2022-11-03 01:54:58,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:58,892 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:54:58,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:54:58,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:58,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:58,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:54:58,934 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 94 for LOIs [2022-11-03 01:54:59,406 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:55:09,627 WARN L234 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 134 DAG size of output: 122 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:55:17,528 WARN L234 SmtUtils]: Spent 7.80s on a formula simplification. DAG size of input: 147 DAG size of output: 132 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:55:19,531 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2863#(and (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |#NULL.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 01:55:19,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:55:19,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:19,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2022-11-03 01:55:19,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572080530] [2022-11-03 01:55:19,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:19,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:55:19,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:19,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:55:19,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-11-03 01:55:19,533 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:55:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:19,786 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2022-11-03 01:55:19,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:55:19,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-11-03 01:55:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:19,787 INFO L225 Difference]: With dead ends: 144 [2022-11-03 01:55:19,788 INFO L226 Difference]: Without dead ends: 144 [2022-11-03 01:55:19,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-11-03 01:55:19,789 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 8 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:19,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 342 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:55:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-03 01:55:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2022-11-03 01:55:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 72 states have (on average 2.0277777777777777) internal successors, (146), 135 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:55:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2022-11-03 01:55:19,795 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 24 [2022-11-03 01:55:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:19,796 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2022-11-03 01:55:19,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:55:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2022-11-03 01:55:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:55:19,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:19,797 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:19,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:20,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-03 01:55:20,001 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:55:20,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:20,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1252332263, now seen corresponding path program 1 times [2022-11-03 01:55:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:20,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574271794] [2022-11-03 01:55:20,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:20,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:55:20,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:20,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574271794] [2022-11-03 01:55:20,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574271794] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:20,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198612528] [2022-11-03 01:55:20,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:20,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:20,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:20,181 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:20,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:55:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:20,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 01:55:20,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:55:20,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:20,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:20,521 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 20 treesize of output 24 [2022-11-03 01:55:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:55:20,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198612528] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:20,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2097092341] [2022-11-03 01:55:20,686 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-03 01:55:20,687 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:55:20,687 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:55:20,687 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:55:20,688 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:55:20,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:55:20,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:55:20,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:55:20,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:55:20,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:20,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:20,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:55:20,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:55:20,815 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 19 treesize of output 1 [2022-11-03 01:55:20,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:55:20,832 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 13 treesize of output 9 [2022-11-03 01:55:20,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:55:20,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:55:20,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:55:20,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:55:20,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:20,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:55:21,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,047 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:55:21,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:55:21,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:55:21,098 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:21,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:21,128 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:21,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:21,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,175 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:55:21,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:55:21,213 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:21,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:55:21,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:21,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:21,282 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:21,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:21,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,408 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 01:55:21,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:21,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:21,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 01:55:21,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:21,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:21,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 01:55:21,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,601 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 260 treesize of output 238 [2022-11-03 01:55:21,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:21,638 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:55:21,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 257 [2022-11-03 01:55:21,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:21,679 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:55:21,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:55:21,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 238 [2022-11-03 01:55:21,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:21,977 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:55:21,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 257 [2022-11-03 01:55:21,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:22,021 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:55:22,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:55:22,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:22,206 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:55:22,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:55:22,247 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:22,260 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:22,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:22,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:22,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:55:22,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:22,350 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:55:22,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:55:22,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:22,395 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:22,408 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:22,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:55:22,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:22,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:55:22,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:22,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:22,563 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:55:22,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:55:22,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:22,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:22,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:55:22,614 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 94 for LOIs [2022-11-03 01:55:23,028 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:55:33,097 WARN L234 SmtUtils]: Spent 7.96s on a formula simplification. DAG size of input: 134 DAG size of output: 122 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:55:41,737 WARN L234 SmtUtils]: Spent 8.48s on a formula simplification. DAG size of input: 147 DAG size of output: 132 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:55:43,832 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3321#(and (< (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |#NULL.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 01:55:43,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:55:43,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:43,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-11-03 01:55:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377014443] [2022-11-03 01:55:43,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:43,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 01:55:43,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:43,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 01:55:43,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2022-11-03 01:55:43,835 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 15 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-03 01:55:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:44,307 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2022-11-03 01:55:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:55:44,308 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 24 [2022-11-03 01:55:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:44,309 INFO L225 Difference]: With dead ends: 147 [2022-11-03 01:55:44,309 INFO L226 Difference]: Without dead ends: 147 [2022-11-03 01:55:44,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 01:55:44,310 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 16 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:44,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1044 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:55:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-03 01:55:44,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 142. [2022-11-03 01:55:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 72 states have (on average 2.013888888888889) internal successors, (145), 135 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:55:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2022-11-03 01:55:44,323 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 24 [2022-11-03 01:55:44,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:44,323 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2022-11-03 01:55:44,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-03 01:55:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2022-11-03 01:55:44,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:55:44,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:44,327 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:44,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:44,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:44,541 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:55:44,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:44,542 INFO L85 PathProgramCache]: Analyzing trace with hash 167594463, now seen corresponding path program 1 times [2022-11-03 01:55:44,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:44,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563496793] [2022-11-03 01:55:44,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:44,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:44,676 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-03 01:55:44,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:44,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563496793] [2022-11-03 01:55:44,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563496793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:44,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:44,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:55:44,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073110376] [2022-11-03 01:55:44,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:44,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:55:44,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:55:44,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:55:44,682 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-03 01:55:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:44,967 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2022-11-03 01:55:44,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:55:44,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 25 [2022-11-03 01:55:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:44,969 INFO L225 Difference]: With dead ends: 142 [2022-11-03 01:55:44,969 INFO L226 Difference]: Without dead ends: 142 [2022-11-03 01:55:44,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:55:44,970 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 18 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:44,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 395 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:55:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-03 01:55:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2022-11-03 01:55:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 72 states have (on average 2.0) internal successors, (144), 134 states have internal predecessors, (144), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:55:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2022-11-03 01:55:44,975 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 25 [2022-11-03 01:55:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:44,975 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2022-11-03 01:55:44,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-03 01:55:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2022-11-03 01:55:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:55:44,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:44,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:44,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 01:55:44,977 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:55:44,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 167594464, now seen corresponding path program 1 times [2022-11-03 01:55:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:44,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442229003] [2022-11-03 01:55:44,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:44,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:45,201 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-03 01:55:45,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:45,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442229003] [2022-11-03 01:55:45,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442229003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:45,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:55:45,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:55:45,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131740110] [2022-11-03 01:55:45,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:45,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:55:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:45,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:55:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:55:45,204 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-03 01:55:45,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:45,484 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-11-03 01:55:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:55:45,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 25 [2022-11-03 01:55:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:45,486 INFO L225 Difference]: With dead ends: 140 [2022-11-03 01:55:45,486 INFO L226 Difference]: Without dead ends: 140 [2022-11-03 01:55:45,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:55:45,487 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 15 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:45,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 425 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:55:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-03 01:55:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-11-03 01:55:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 133 states have internal predecessors, (143), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:55:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2022-11-03 01:55:45,492 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 25 [2022-11-03 01:55:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:45,492 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2022-11-03 01:55:45,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-03 01:55:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2022-11-03 01:55:45,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 01:55:45,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:45,493 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:45,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 01:55:45,494 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:55:45,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1568588154, now seen corresponding path program 1 times [2022-11-03 01:55:45,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:45,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077103845] [2022-11-03 01:55:45,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:45,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 01:55:46,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:46,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077103845] [2022-11-03 01:55:46,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077103845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:46,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910557104] [2022-11-03 01:55:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:46,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:46,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:46,019 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:46,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:55:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:46,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 01:55:46,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:46,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:55:46,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:46,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:46,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:55:46,370 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-11-03 01:55:46,371 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 14 treesize of output 13 [2022-11-03 01:55:46,486 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:55:46,487 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-03 01:55:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:55:46,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:46,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910557104] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:46,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [871789976] [2022-11-03 01:55:46,917 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-03 01:55:46,917 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:55:46,917 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:55:46,918 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:55:46,918 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:55:46,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:46,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:46,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:55:46,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:46,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:46,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:55:46,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:55:46,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:55:47,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:47,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:47,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:55:47,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:55:47,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:55:47,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:55:47,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:55:47,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:55:47,070 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 13 treesize of output 9 [2022-11-03 01:55:47,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:55:47,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:55:47,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:55:47,316 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:55:47,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:55:47,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,514 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:55:47,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:55:47,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:55:47,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:47,556 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:55:47,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:47,579 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:55:47,583 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:55:47,584 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:55:47,662 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:55:47,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:55:47,877 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:47,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:55:47,899 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:47,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:47,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:47,935 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:55:47,938 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:55:47,939 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:55:48,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:48,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,042 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 01:55:48,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:48,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:48,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 01:55:48,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:48,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:48,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 01:55:48,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,183 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 260 treesize of output 238 [2022-11-03 01:55:48,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:48,214 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:55:48,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 257 [2022-11-03 01:55:48,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:48,252 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:55:48,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:55:48,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,384 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 260 treesize of output 238 [2022-11-03 01:55:48,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:48,418 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:55:48,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 257 [2022-11-03 01:55:48,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:48,464 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:55:48,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:55:48,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:48,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:48,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:55:48,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:55:48,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:55:48,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:55:48,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:48,880 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:55:48,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:55:48,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:48,904 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 19 [2022-11-03 01:55:48,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:48,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:48,939 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:55:48,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:55:48,968 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:55:48,968 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 7 [2022-11-03 01:55:49,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:49,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:49,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:49,110 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:55:49,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:55:49,133 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:55:49,133 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 7 [2022-11-03 01:55:49,158 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:49,159 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 19 [2022-11-03 01:55:49,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:49,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:49,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:55:49,191 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:55:49,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:55:49,484 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:55:49,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:55:49,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:55:49,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:49,657 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:49,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:49,679 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:49,692 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:55:49,694 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:55:49,696 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:55:49,797 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:55:49,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:55:50,023 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:50,035 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:55:50,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:55:50,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:50,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:50,095 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:55:50,098 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:55:50,101 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:55:50,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:55:50,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:50,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:50,296 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:55:50,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:55:50,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:50,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:50,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:55:50,438 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 01:55:50,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:55:50,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:55:50,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:50,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:55:50,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:55:50,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:50,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:55:50,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:50,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:55:50,498 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 19 treesize of output 1 [2022-11-03 01:55:50,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:50,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:50,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:55:50,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:50,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:50,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:55:50,530 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 13 treesize of output 9 [2022-11-03 01:55:50,531 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:55:55,553 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4419#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) 0) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) 0) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_#in~data#1| |ULTIMATE.start_dll_circular_insert_~data#1|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 0) (= |ULTIMATE.start_dll_circular_insert_#in~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 0) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_dll_circular_insert_~index#1| |ULTIMATE.start_dll_circular_insert_#in~index#1|) (= (select |#length| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 12) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (< |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (not (= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|))) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (= |ULTIMATE.start_dll_circular_insert_~data#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (ite (and (not (= (mod |ULTIMATE.start_main_~len~0#1| 2) 0)) (< |ULTIMATE.start_main_~len~0#1| 0)) (+ (div |ULTIMATE.start_main_~len~0#1| 2) 1) (div |ULTIMATE.start_main_~len~0#1| 2)) |ULTIMATE.start_dll_circular_insert_#in~index#1|) (= |#NULL.base| 0))' at error location [2022-11-03 01:55:55,553 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:55:55,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:55:55,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 14 [2022-11-03 01:55:55,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752462253] [2022-11-03 01:55:55,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:55,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 01:55:55,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:55,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 01:55:55,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1550, Unknown=0, NotChecked=0, Total=1722 [2022-11-03 01:55:55,555 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand has 16 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 01:55:56,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:56,096 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-11-03 01:55:56,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:55:56,097 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2022-11-03 01:55:56,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:56,098 INFO L225 Difference]: With dead ends: 148 [2022-11-03 01:55:56,098 INFO L226 Difference]: Without dead ends: 148 [2022-11-03 01:55:56,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=202, Invalid=1778, Unknown=0, NotChecked=0, Total=1980 [2022-11-03 01:55:56,099 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 240 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:56,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 492 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 620 Invalid, 0 Unknown, 95 Unchecked, 0.4s Time] [2022-11-03 01:55:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-03 01:55:56,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 131. [2022-11-03 01:55:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 124 states have internal predecessors, (134), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:55:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2022-11-03 01:55:56,104 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 34 [2022-11-03 01:55:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:56,104 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2022-11-03 01:55:56,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 01:55:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-11-03 01:55:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 01:55:56,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:56,106 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:56,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:56,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:56,317 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:55:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1568588155, now seen corresponding path program 1 times [2022-11-03 01:55:56,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:56,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122250065] [2022-11-03 01:55:56,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:56,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 01:55:56,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:56,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122250065] [2022-11-03 01:55:56,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122250065] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:56,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978320467] [2022-11-03 01:55:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:56,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:56,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:56,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:57,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:55:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:57,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 01:55:57,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:57,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:55:57,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:57,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:57,433 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_87| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_87| |c_#length|))) (and (<= (+ .cse0 1) |c_#StackHeapBarrier|) (<= 4 (select |v_#length_BEFORE_CALL_87| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (store |v_#length_BEFORE_CALL_87| .cse0 (select |c_#length| .cse0)) |c_#length|)))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-03 01:55:57,436 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_87| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_87| |c_#length|))) (and (<= (+ .cse0 1) |c_#StackHeapBarrier|) (<= 4 (select |v_#length_BEFORE_CALL_87| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (store |v_#length_BEFORE_CALL_87| .cse0 (select |c_#length| .cse0)) |c_#length|)))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-03 01:55:57,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:55:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:55:57,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:55:57,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978320467] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:57,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:55:57,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2022-11-03 01:55:57,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89686859] [2022-11-03 01:55:57,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:57,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:55:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:55:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=102, Unknown=2, NotChecked=20, Total=156 [2022-11-03 01:55:57,623 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 8 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:55:57,680 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_87| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_87| |c_#length|))) (and (<= (+ .cse0 1) |c_#StackHeapBarrier|) (<= 4 (select |v_#length_BEFORE_CALL_87| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (store |v_#length_BEFORE_CALL_87| .cse0 (select |c_#length| .cse0)) |c_#length|)))) .cse1) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-03 01:55:57,683 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_87| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_87| |c_#length|))) (and (<= (+ .cse0 1) |c_#StackHeapBarrier|) (<= 4 (select |v_#length_BEFORE_CALL_87| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (store |v_#length_BEFORE_CALL_87| .cse0 (select |c_#length| .cse0)) |c_#length|)))) .cse1) .cse1 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-03 01:55:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:57,933 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2022-11-03 01:55:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:55:57,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-11-03 01:55:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:57,935 INFO L225 Difference]: With dead ends: 121 [2022-11-03 01:55:57,935 INFO L226 Difference]: Without dead ends: 121 [2022-11-03 01:55:57,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=121, Unknown=4, NotChecked=46, Total=210 [2022-11-03 01:55:57,936 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 268 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:57,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 159 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 209 Invalid, 0 Unknown, 115 Unchecked, 0.3s Time] [2022-11-03 01:55:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-03 01:55:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-11-03 01:55:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 72 states have (on average 1.7222222222222223) internal successors, (124), 114 states have internal predecessors, (124), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-03 01:55:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2022-11-03 01:55:57,940 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 34 [2022-11-03 01:55:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:57,940 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2022-11-03 01:55:57,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 01:55:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2022-11-03 01:55:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 01:55:57,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:57,941 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:57,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:58,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 01:55:58,153 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:55:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1807871722, now seen corresponding path program 1 times [2022-11-03 01:55:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:58,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253521461] [2022-11-03 01:55:58,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 01:55:58,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:58,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253521461] [2022-11-03 01:55:58,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253521461] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:58,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444616850] [2022-11-03 01:55:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:58,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:58,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:58,273 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:58,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:55:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:58,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:55:58,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:55:58,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:55:58,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444616850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:55:58,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:55:58,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-03 01:55:58,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934200951] [2022-11-03 01:55:58,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:55:58,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:55:58,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:58,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:55:58,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:55:58,495 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-03 01:55:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:58,530 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-11-03 01:55:58,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:55:58,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 34 [2022-11-03 01:55:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:58,531 INFO L225 Difference]: With dead ends: 109 [2022-11-03 01:55:58,531 INFO L226 Difference]: Without dead ends: 109 [2022-11-03 01:55:58,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:55:58,532 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 92 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:58,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 111 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:55:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-03 01:55:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-03 01:55:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 103 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:55:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2022-11-03 01:55:58,536 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 34 [2022-11-03 01:55:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:58,537 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2022-11-03 01:55:58,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-03 01:55:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-11-03 01:55:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 01:55:58,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:58,538 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:55:58,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:58,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:58,753 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:55:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:58,754 INFO L85 PathProgramCache]: Analyzing trace with hash -120110940, now seen corresponding path program 1 times [2022-11-03 01:55:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:58,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013137949] [2022-11-03 01:55:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:58,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:55:59,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:59,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013137949] [2022-11-03 01:55:59,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013137949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:59,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341820496] [2022-11-03 01:55:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:59,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:59,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:59,475 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:59,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:55:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:59,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:55:59,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:59,876 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-03 01:56:00,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:00,085 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-03 01:56:00,103 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-03 01:56:00,104 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 21 treesize of output 29 [2022-11-03 01:56:00,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 01:56:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:56:00,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:56:00,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341820496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:00,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:56:00,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2022-11-03 01:56:00,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870886155] [2022-11-03 01:56:00,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:00,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 01:56:00,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:00,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 01:56:00,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=441, Unknown=2, NotChecked=0, Total=506 [2022-11-03 01:56:00,144 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 11 states have internal predecessors, (25), 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-03 01:56:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:00,540 INFO L93 Difference]: Finished difference Result 188 states and 202 transitions. [2022-11-03 01:56:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 01:56:00,540 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 11 states have internal predecessors, (25), 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 36 [2022-11-03 01:56:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:00,542 INFO L225 Difference]: With dead ends: 188 [2022-11-03 01:56:00,542 INFO L226 Difference]: Without dead ends: 188 [2022-11-03 01:56:00,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=559, Unknown=2, NotChecked=0, Total=650 [2022-11-03 01:56:00,543 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 119 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:00,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 352 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 412 Invalid, 0 Unknown, 169 Unchecked, 0.3s Time] [2022-11-03 01:56:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-03 01:56:00,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 116. [2022-11-03 01:56:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 72 states have (on average 1.7638888888888888) internal successors, (127), 110 states have internal predecessors, (127), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:56:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2022-11-03 01:56:00,549 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 36 [2022-11-03 01:56:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:00,550 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2022-11-03 01:56:00,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 11 states have internal predecessors, (25), 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-03 01:56:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2022-11-03 01:56:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 01:56:00,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:00,551 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:56:00,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:00,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:00,769 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:56:00,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:00,770 INFO L85 PathProgramCache]: Analyzing trace with hash -120110939, now seen corresponding path program 1 times [2022-11-03 01:56:00,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:00,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944533859] [2022-11-03 01:56:00,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:00,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:56:02,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:02,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944533859] [2022-11-03 01:56:02,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944533859] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:02,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850772362] [2022-11-03 01:56:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:02,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:02,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:02,669 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:02,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:56:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:02,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 01:56:02,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:03,453 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-03 01:56:03,460 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-03 01:56:03,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:03,855 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-03 01:56:03,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:03,865 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-03 01:56:03,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:03,874 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-03 01:56:03,885 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-03 01:56:03,885 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-03 01:56:03,948 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-03 01:56:03,951 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-03 01:56:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:56:03,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:04,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850772362] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:04,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2089895565] [2022-11-03 01:56:04,597 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-03 01:56:04,597 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:56:04,598 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:56:04,598 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:56:04,598 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:56:04,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:56:04,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:56:04,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:56:04,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:56:04,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:04,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:04,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:04,698 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 19 treesize of output 1 [2022-11-03 01:56:04,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:04,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:04,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:56:04,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:56:04,747 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 13 treesize of output 9 [2022-11-03 01:56:04,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:56:04,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:56:04,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:56:04,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,893 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:04,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:04,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:04,941 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:04,952 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:04,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:04,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:05,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:05,032 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:05,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:05,095 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:05,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:05,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:05,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:05,144 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:05,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:05,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:05,263 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 01:56:05,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:05,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:05,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:05,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 01:56:05,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:05,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:05,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:05,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:05,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 01:56:05,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:05,399 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 260 treesize of output 238 [2022-11-03 01:56:05,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:05,434 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:56:05,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 257 [2022-11-03 01:56:05,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:05,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:05,475 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:56:05,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:56:05,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:05,637 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 260 treesize of output 238 [2022-11-03 01:56:05,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:05,670 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:56:05,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 257 [2022-11-03 01:56:05,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:05,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:05,710 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:56:05,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:56:05,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:05,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:05,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:05,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:05,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:05,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:56:06,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:06,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:06,171 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 19 [2022-11-03 01:56:06,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:06,207 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:06,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:56:06,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:06,239 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:06,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:56:06,260 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:06,260 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 7 [2022-11-03 01:56:06,372 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:06,373 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 19 [2022-11-03 01:56:06,402 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:06,402 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 7 [2022-11-03 01:56:06,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:06,432 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:06,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:56:06,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:06,457 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:06,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:56:06,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,624 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:06,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:06,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:06,665 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:06,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:06,687 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:06,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:06,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,736 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:06,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:06,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:06,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:06,805 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:06,822 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:06,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:06,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:06,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:06,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:06,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,951 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:06,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:06,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:06,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:56:06,989 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 01:56:06,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:56:07,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:56:07,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:07,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:07,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:07,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:07,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:07,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:56:07,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:07,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:07,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:07,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:07,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:56:07,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:07,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:07,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:56:07,104 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 13 treesize of output 9 [2022-11-03 01:56:07,107 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:56:14,773 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5995#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) 0) (= |ULTIMATE.start_dll_circular_insert_~head#1.base| |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) 0) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_#in~data#1| |ULTIMATE.start_dll_circular_insert_~data#1|) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 0) (= |ULTIMATE.start_dll_circular_insert_#in~data#1| |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 4) 0) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (< 0 |ULTIMATE.start_dll_circular_insert_~index#1|) (= |ULTIMATE.start_dll_circular_insert_~index#1| |ULTIMATE.start_dll_circular_insert_#in~index#1|) (<= (+ |ULTIMATE.start_dll_circular_insert_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (= (select |#length| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 12) (or (not (<= 0 |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (not (<= (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (< |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_circular_insert_~head#1.offset| |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (<= 0 |#NULL.offset|) (= |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (= |ULTIMATE.start_dll_circular_insert_~data#1| (select (select |#memory_int| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 8)) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (ite (and (not (= (mod |ULTIMATE.start_main_~len~0#1| 2) 0)) (< |ULTIMATE.start_main_~len~0#1| 0)) (+ (div |ULTIMATE.start_main_~len~0#1| 2) 1) (div |ULTIMATE.start_main_~len~0#1| 2)) |ULTIMATE.start_dll_circular_insert_#in~index#1|) (= |#NULL.base| 0))' at error location [2022-11-03 01:56:14,774 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:56:14,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:56:14,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2022-11-03 01:56:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110846514] [2022-11-03 01:56:14,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:14,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 01:56:14,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:14,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 01:56:14,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2651, Unknown=2, NotChecked=0, Total=2862 [2022-11-03 01:56:14,776 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand has 29 states, 22 states have (on average 2.5) internal successors, (55), 25 states have internal predecessors, (55), 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-03 01:56:16,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:16,869 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2022-11-03 01:56:16,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 01:56:16,870 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.5) internal successors, (55), 25 states have internal predecessors, (55), 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 36 [2022-11-03 01:56:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:16,871 INFO L225 Difference]: With dead ends: 186 [2022-11-03 01:56:16,871 INFO L226 Difference]: Without dead ends: 186 [2022-11-03 01:56:16,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=300, Invalid=3727, Unknown=5, NotChecked=0, Total=4032 [2022-11-03 01:56:16,873 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 167 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:16,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 969 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1110 Invalid, 0 Unknown, 191 Unchecked, 1.1s Time] [2022-11-03 01:56:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-03 01:56:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 116. [2022-11-03 01:56:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 72 states have (on average 1.7361111111111112) internal successors, (125), 110 states have internal predecessors, (125), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:56:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2022-11-03 01:56:16,878 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 36 [2022-11-03 01:56:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:16,879 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2022-11-03 01:56:16,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.5) internal successors, (55), 25 states have internal predecessors, (55), 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-03 01:56:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2022-11-03 01:56:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 01:56:16,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:16,880 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:16,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:17,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 01:56:17,080 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:56:17,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash 571722593, now seen corresponding path program 1 times [2022-11-03 01:56:17,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:17,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879094253] [2022-11-03 01:56:17,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:17,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:56:17,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:17,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879094253] [2022-11-03 01:56:17,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879094253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:17,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:17,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:17,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124690956] [2022-11-03 01:56:17,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:17,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:56:17,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:17,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:56:17,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:17,168 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 01:56:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:17,225 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2022-11-03 01:56:17,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:56:17,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-11-03 01:56:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:17,226 INFO L225 Difference]: With dead ends: 151 [2022-11-03 01:56:17,227 INFO L226 Difference]: Without dead ends: 151 [2022-11-03 01:56:17,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:56:17,228 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 69 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:17,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 157 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-03 01:56:17,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 112. [2022-11-03 01:56:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 106 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:56:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2022-11-03 01:56:17,232 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 37 [2022-11-03 01:56:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:17,233 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2022-11-03 01:56:17,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 01:56:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2022-11-03 01:56:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 01:56:17,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:17,234 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:17,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 01:56:17,235 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:56:17,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash 537682238, now seen corresponding path program 1 times [2022-11-03 01:56:17,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:17,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787399015] [2022-11-03 01:56:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:17,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:56:17,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:17,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787399015] [2022-11-03 01:56:17,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787399015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:17,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:17,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:17,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365911986] [2022-11-03 01:56:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:17,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:56:17,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:17,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:56:17,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:17,436 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-03 01:56:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:17,496 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-11-03 01:56:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:56:17,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 38 [2022-11-03 01:56:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:17,498 INFO L225 Difference]: With dead ends: 109 [2022-11-03 01:56:17,498 INFO L226 Difference]: Without dead ends: 109 [2022-11-03 01:56:17,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:17,499 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 169 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:17,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 131 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:56:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-03 01:56:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-03 01:56:17,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 103 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:56:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2022-11-03 01:56:17,504 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 38 [2022-11-03 01:56:17,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:17,504 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2022-11-03 01:56:17,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-03 01:56:17,505 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-11-03 01:56:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 01:56:17,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:17,506 INFO L195 NwaCegarLoop]: trace histogram [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-03 01:56:17,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 01:56:17,507 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:56:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash -329968766, now seen corresponding path program 1 times [2022-11-03 01:56:17,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:17,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852330307] [2022-11-03 01:56:17,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:56:17,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:17,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852330307] [2022-11-03 01:56:17,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852330307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:17,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:17,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:17,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632715400] [2022-11-03 01:56:17,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:17,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:56:17,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:56:17,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:17,631 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 6 states, 4 states have (on average 6.5) 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-03 01:56:17,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:17,853 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-11-03 01:56:17,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:56:17,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) 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 39 [2022-11-03 01:56:17,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:17,854 INFO L225 Difference]: With dead ends: 120 [2022-11-03 01:56:17,854 INFO L226 Difference]: Without dead ends: 120 [2022-11-03 01:56:17,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:17,855 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:17,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 186 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-03 01:56:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2022-11-03 01:56:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.5522388059701493) 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-03 01:56:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-11-03 01:56:17,858 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 39 [2022-11-03 01:56:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:17,859 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-11-03 01:56:17,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) 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-03 01:56:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-11-03 01:56:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 01:56:17,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:17,860 INFO L195 NwaCegarLoop]: trace histogram [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-03 01:56:17,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 01:56:17,860 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:56:17,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash -329968765, now seen corresponding path program 1 times [2022-11-03 01:56:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:17,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406841871] [2022-11-03 01:56:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:17,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:56:17,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:17,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406841871] [2022-11-03 01:56:17,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406841871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:17,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:17,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:56:17,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911787466] [2022-11-03 01:56:17,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:17,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:17,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:17,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:17,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:17,982 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-03 01:56:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:18,029 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-11-03 01:56:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:18,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 39 [2022-11-03 01:56:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:18,030 INFO L225 Difference]: With dead ends: 102 [2022-11-03 01:56:18,030 INFO L226 Difference]: Without dead ends: 102 [2022-11-03 01:56:18,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:18,031 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 82 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:18,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 171 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:56:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-03 01:56:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-03 01:56:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 96 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:56:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-11-03 01:56:18,035 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 39 [2022-11-03 01:56:18,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:18,035 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-11-03 01:56:18,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-03 01:56:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-11-03 01:56:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 01:56:18,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:18,036 INFO L195 NwaCegarLoop]: trace histogram [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-03 01:56:18,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 01:56:18,037 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:56:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash -511525369, now seen corresponding path program 1 times [2022-11-03 01:56:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:18,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252855044] [2022-11-03 01:56:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:56:18,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:18,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252855044] [2022-11-03 01:56:18,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252855044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:18,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:18,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448878458] [2022-11-03 01:56:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:18,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:18,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:18,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:18,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:18,133 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 01:56:18,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:18,275 INFO L93 Difference]: Finished difference Result 155 states and 166 transitions. [2022-11-03 01:56:18,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:56:18,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-03 01:56:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:18,278 INFO L225 Difference]: With dead ends: 155 [2022-11-03 01:56:18,278 INFO L226 Difference]: Without dead ends: 155 [2022-11-03 01:56:18,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:18,279 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 146 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:18,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 122 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:18,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-03 01:56:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 101. [2022-11-03 01:56:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.5303030303030303) internal successors, (101), 95 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-03 01:56:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2022-11-03 01:56:18,282 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 39 [2022-11-03 01:56:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:18,283 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2022-11-03 01:56:18,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 01:56:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2022-11-03 01:56:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 01:56:18,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:18,284 INFO L195 NwaCegarLoop]: trace histogram [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-03 01:56:18,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 01:56:18,284 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:56:18,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:18,285 INFO L85 PathProgramCache]: Analyzing trace with hash -511525368, now seen corresponding path program 1 times [2022-11-03 01:56:18,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:18,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067192902] [2022-11-03 01:56:18,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:18,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:56:18,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:18,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067192902] [2022-11-03 01:56:18,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067192902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:18,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:18,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596813197] [2022-11-03 01:56:18,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:18,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:18,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:18,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:18,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:18,435 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 01:56:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:18,550 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-11-03 01:56:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:18,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-03 01:56:18,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:18,551 INFO L225 Difference]: With dead ends: 100 [2022-11-03 01:56:18,551 INFO L226 Difference]: Without dead ends: 100 [2022-11-03 01:56:18,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-03 01:56:18,552 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:18,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 113 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-03 01:56:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-11-03 01:56:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:56:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-11-03 01:56:18,556 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 39 [2022-11-03 01:56:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:18,557 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-11-03 01:56:18,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 01:56:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-11-03 01:56:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 01:56:18,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:18,557 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:56:18,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 01:56:18,558 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:56:18,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:18,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1322582785, now seen corresponding path program 1 times [2022-11-03 01:56:18,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:18,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10504922] [2022-11-03 01:56:18,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:18,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 01:56:18,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:18,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10504922] [2022-11-03 01:56:18,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10504922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:18,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:18,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:56:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777008687] [2022-11-03 01:56:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:18,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:56:18,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:18,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:56:18,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:18,805 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 6 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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-03 01:56:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:18,994 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2022-11-03 01:56:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:56:18,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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-03 01:56:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:18,995 INFO L225 Difference]: With dead ends: 94 [2022-11-03 01:56:18,995 INFO L226 Difference]: Without dead ends: 94 [2022-11-03 01:56:18,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:56:18,996 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:18,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 199 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:56:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-03 01:56:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-11-03 01:56:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:56:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-11-03 01:56:18,999 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 40 [2022-11-03 01:56:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:18,999 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-11-03 01:56:18,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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-03 01:56:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-11-03 01:56:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 01:56:19,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:19,000 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:56:19,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 01:56:19,000 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:56:19,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:19,001 INFO L85 PathProgramCache]: Analyzing trace with hash -308262845, now seen corresponding path program 1 times [2022-11-03 01:56:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:19,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262904504] [2022-11-03 01:56:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:19,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:21,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:21,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262904504] [2022-11-03 01:56:21,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262904504] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:21,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540940446] [2022-11-03 01:56:21,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:21,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:21,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:21,078 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:21,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 01:56:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:21,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-03 01:56:21,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:21,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:56:21,601 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:56:21,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 01:56:21,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:21,867 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:56:21,867 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 35 treesize of output 34 [2022-11-03 01:56:22,055 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:56:22,055 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-03 01:56:22,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2022-11-03 01:56:22,201 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:22,202 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 39 treesize of output 22 [2022-11-03 01:56:22,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:22,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:22,462 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:56:22,462 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 45 treesize of output 43 [2022-11-03 01:56:22,492 INFO L356 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-03 01:56:22,492 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 36 treesize of output 52 [2022-11-03 01:56:22,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:22,510 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-03 01:56:22,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:22,844 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-03 01:56:22,845 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 36 [2022-11-03 01:56:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:23,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:23,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_19| Int) (v_ArrVal_2480 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_19| v_ArrVal_2480) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (<= 0 .cse0)) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_19| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_19| 1) (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_19| v_ArrVal_2479))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) .cse0)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_19|) 0))))) is different from false [2022-11-03 01:56:23,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540940446] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:23,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1695959794] [2022-11-03 01:56:23,509 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-03 01:56:23,510 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:56:23,510 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:56:23,510 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:56:23,510 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:56:23,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:56:23,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:56:23,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:56:23,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:56:23,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:23,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:23,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:23,616 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 19 treesize of output 1 [2022-11-03 01:56:23,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:23,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:23,635 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 13 treesize of output 9 [2022-11-03 01:56:23,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:56:23,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:56:23,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:56:23,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:56:23,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:56:23,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,810 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:23,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:23,846 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:23,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:23,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:23,875 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:23,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:23,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:23,914 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:23,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:23,952 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:23,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:23,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:23,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:23,994 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:24,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:24,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 01:56:24,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:24,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:24,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:24,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 01:56:24,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:24,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:24,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:24,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 01:56:24,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:24,276 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 260 treesize of output 238 [2022-11-03 01:56:24,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:24,308 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:56:24,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 257 [2022-11-03 01:56:24,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:24,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:24,346 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:56:24,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:56:24,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:24,492 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 260 treesize of output 238 [2022-11-03 01:56:24,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:24,530 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:56:24,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:56:24,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:24,566 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:56:24,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 245 [2022-11-03 01:56:24,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:24,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:24,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:24,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:24,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:56:24,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:24,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:24,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:24,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:24,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:24,992 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:24,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:56:25,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:25,016 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:25,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:56:25,042 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:25,043 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 19 [2022-11-03 01:56:25,064 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:25,065 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 7 [2022-11-03 01:56:25,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,177 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:25,183 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:25,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:56:25,202 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:25,202 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 7 [2022-11-03 01:56:25,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:25,228 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:25,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:56:25,259 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:25,259 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 19 [2022-11-03 01:56:25,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:25,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:25,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:25,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:56:25,638 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:56:25,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:25,676 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 01:56:25,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 01:56:25,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:25,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,751 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 01:56:25,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 01:56:25,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,799 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 01:56:25,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 01:56:25,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,871 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:25,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:25,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:25,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:25,928 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:25,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:25,949 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:25,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,974 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:25,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:26,012 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:26,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:26,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:26,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:26,059 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:26,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:26,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:26,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:26,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,179 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:26,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:26,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:56:26,223 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2022-11-03 01:56:26,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:56:26,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:56:26,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:26,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:26,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:26,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:26,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:56:26,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:26,291 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 13 treesize of output 9 [2022-11-03 01:56:26,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:56:26,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:26,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:56:26,314 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:56:34,910 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8145#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (= (select |#valid| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) 1) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (or (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0)) (not (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ 4 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (or (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (and (= (+ 4 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (and (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ 4 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1)) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (<= (+ |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= (+ 8 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (select |#length| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (<= 0 |#StackHeapBarrier|) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (and (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|))) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 01:56:34,911 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:56:34,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:56:34,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 45 [2022-11-03 01:56:34,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728694007] [2022-11-03 01:56:34,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:34,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-03 01:56:34,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:34,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-03 01:56:34,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=5791, Unknown=2, NotChecked=154, Total=6320 [2022-11-03 01:56:34,915 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 46 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 39 states have internal predecessors, (68), 6 states have call successors, (6), 3 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-03 01:56:36,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:36,458 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-11-03 01:56:36,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 01:56:36,459 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 39 states have internal predecessors, (68), 6 states have call successors, (6), 3 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 42 [2022-11-03 01:56:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:36,460 INFO L225 Difference]: With dead ends: 93 [2022-11-03 01:56:36,460 INFO L226 Difference]: Without dead ends: 93 [2022-11-03 01:56:36,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=449, Invalid=6693, Unknown=2, NotChecked=166, Total=7310 [2022-11-03 01:56:36,463 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:36,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 665 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 973 Invalid, 0 Unknown, 124 Unchecked, 1.0s Time] [2022-11-03 01:56:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-03 01:56:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-03 01:56:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 87 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:56:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-11-03 01:56:36,467 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 42 [2022-11-03 01:56:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:36,467 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-11-03 01:56:36,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 39 states have internal predecessors, (68), 6 states have call successors, (6), 3 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-03 01:56:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-11-03 01:56:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 01:56:36,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:36,469 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:56:36,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:36,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-03 01:56:36,669 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:56:36,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash -308262844, now seen corresponding path program 1 times [2022-11-03 01:56:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:36,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775599192] [2022-11-03 01:56:36,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:36,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:40,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:40,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775599192] [2022-11-03 01:56:40,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775599192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:40,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391732582] [2022-11-03 01:56:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:40,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:40,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:40,078 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:40,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 01:56:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:40,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 120 conjunts are in the unsatisfiable core [2022-11-03 01:56:40,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:40,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:56:40,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:56:40,819 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:56:40,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 01:56:40,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:56:41,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:41,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:41,183 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:56:41,183 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 54 treesize of output 49 [2022-11-03 01:56:41,191 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-03 01:56:41,488 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:56:41,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, 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-03 01:56:41,501 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-03 01:56:41,619 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 26 [2022-11-03 01:56:41,637 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 62 treesize of output 41 [2022-11-03 01:56:41,746 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:41,747 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 63 treesize of output 34 [2022-11-03 01:56:41,755 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:41,960 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2712 (Array Int Int)) (v_ArrVal_2711 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2712) |c_#memory_$Pointer$.base|) (<= (+ |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|)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2711) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-03 01:56:41,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:41,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:41,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:41,982 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 01:56:41,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:42,000 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:56:42,001 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 69 treesize of output 59 [2022-11-03 01:56:42,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:42,007 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 22 treesize of output 17 [2022-11-03 01:56:42,026 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-03 01:56:42,027 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 28 treesize of output 30 [2022-11-03 01:56:42,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:42,291 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-03 01:56:42,291 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 37 [2022-11-03 01:56:42,305 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-03 01:56:42,305 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2022-11-03 01:56:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:56:42,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:43,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391732582] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:43,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [479546820] [2022-11-03 01:56:43,190 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-03 01:56:43,190 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:56:43,191 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:56:43,191 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:56:43,191 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:56:43,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:56:43,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:56:43,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:56:43,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:56:43,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:43,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:43,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:43,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:43,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:43,290 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 19 treesize of output 1 [2022-11-03 01:56:43,298 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 13 treesize of output 9 [2022-11-03 01:56:43,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:56:43,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:56:43,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:56:43,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:56:43,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:56:43,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,454 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:43,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:43,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:43,497 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:43,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:43,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:43,529 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:43,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,558 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:43,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:43,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:43,595 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:43,608 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:43,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:43,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:43,670 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:56:43,685 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 23 treesize of output 11 [2022-11-03 01:56:43,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:56:43,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:43,737 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:56:43,737 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:56:43,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:43,765 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:56:43,765 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 01:56:43,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,787 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 27 treesize of output 11 [2022-11-03 01:56:43,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:43,854 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:56:43,854 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 01:56:43,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:43,879 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:56:43,879 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:56:43,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:43,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 01:56:43,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:43,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:43,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:44,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:44,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:44,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:56:44,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:44,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:44,245 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:44,246 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 7 [2022-11-03 01:56:44,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:44,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:44,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:44,270 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:44,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:56:44,293 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:44,293 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 19 [2022-11-03 01:56:44,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:44,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:44,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:44,332 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:44,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:56:44,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:44,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:44,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:44,455 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:44,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:56:44,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:44,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:44,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:56:44,489 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:44,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:56:44,527 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:44,528 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 19 [2022-11-03 01:56:44,583 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:56:44,583 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 7 [2022-11-03 01:56:44,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:44,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:44,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:44,965 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 01:56:44,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 01:56:44,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:56:45,023 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:56:45,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:45,110 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 01:56:45,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 01:56:45,167 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 01:56:45,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 01:56:45,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:45,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:45,313 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:45,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:45,357 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:45,367 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:45,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:45,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:45,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:45,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:45,431 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:45,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:45,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:45,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:56:45,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:56:45,493 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:45,506 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:56:45,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:45,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:45,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:45,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:45,639 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:45,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:56:45,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:45,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:45,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:56:45,674 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 65 for LOIs [2022-11-03 01:56:45,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:56:45,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:56:45,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:56:45,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:45,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:56:45,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:45,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:45,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:45,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:56:45,949 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 19 treesize of output 1 [2022-11-03 01:56:45,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:45,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:46,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:56:46,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:46,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:46,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:56:46,038 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 13 treesize of output 9 [2022-11-03 01:56:46,058 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:56:56,579 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8576#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (or (not (<= 0 (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4))) (not (<= (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 8) (select |#length| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)))) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|))' at error location [2022-11-03 01:56:56,579 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:56:56,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:56:56,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 43 [2022-11-03 01:56:56,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144072246] [2022-11-03 01:56:56,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:56,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 01:56:56,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:56,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 01:56:56,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=5242, Unknown=1, NotChecked=146, Total=5700 [2022-11-03 01:56:56,582 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 44 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 37 states have internal predecessors, (62), 6 states have call successors, (6), 3 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-03 01:56:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:58,574 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2022-11-03 01:56:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 01:56:58,575 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 37 states have internal predecessors, (62), 6 states have call successors, (6), 3 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 42 [2022-11-03 01:56:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:58,576 INFO L225 Difference]: With dead ends: 92 [2022-11-03 01:56:58,576 INFO L226 Difference]: Without dead ends: 92 [2022-11-03 01:56:58,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2273 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=405, Invalid=6240, Unknown=1, NotChecked=160, Total=6806 [2022-11-03 01:56:58,578 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 96 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:58,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 570 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1213 Invalid, 0 Unknown, 146 Unchecked, 1.2s Time] [2022-11-03 01:56:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-03 01:56:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-03 01:56:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.393939393939394) internal successors, (92), 86 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:56:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-11-03 01:56:58,600 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 42 [2022-11-03 01:56:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:58,600 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-11-03 01:56:58,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 37 states have internal predecessors, (62), 6 states have call successors, (6), 3 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-03 01:56:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-11-03 01:56:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-03 01:56:58,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:58,602 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:56:58,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:58,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:58,821 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:56:58,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:58,822 INFO L85 PathProgramCache]: Analyzing trace with hash 112152484, now seen corresponding path program 1 times [2022-11-03 01:56:58,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:58,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012903908] [2022-11-03 01:56:58,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:58,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 01:56:58,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:58,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012903908] [2022-11-03 01:56:58,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012903908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:58,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:58,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:56:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863172666] [2022-11-03 01:56:58,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:58,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:56:58,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:58,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:56:58,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:56:58,955 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-03 01:56:59,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:59,074 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-11-03 01:56:59,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:56:59,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 44 [2022-11-03 01:56:59,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:59,076 INFO L225 Difference]: With dead ends: 108 [2022-11-03 01:56:59,076 INFO L226 Difference]: Without dead ends: 108 [2022-11-03 01:56:59,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:56:59,077 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 137 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:59,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 87 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:59,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-03 01:56:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 91. [2022-11-03 01:56:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.378787878787879) 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-03 01:56:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-11-03 01:56:59,081 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 44 [2022-11-03 01:56:59,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:59,082 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-11-03 01:56:59,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-03 01:56:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-11-03 01:56:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:56:59,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:59,084 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:56:59,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-03 01:56:59,084 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:56:59,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:59,085 INFO L85 PathProgramCache]: Analyzing trace with hash -818236250, now seen corresponding path program 1 times [2022-11-03 01:56:59,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:59,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251149462] [2022-11-03 01:56:59,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:59,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:57:02,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:02,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251149462] [2022-11-03 01:57:02,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251149462] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:02,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386843867] [2022-11-03 01:57:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:02,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:02,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:02,036 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:02,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 01:57:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:02,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-03 01:57:02,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:02,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:57:02,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:02,477 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:57:02,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 01:57:02,619 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-03 01:57:02,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:02,772 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:57:02,772 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 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-03 01:57:02,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:03,095 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:57:03,095 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 34 treesize of output 33 [2022-11-03 01:57:03,331 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:57:03,331 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 27 treesize of output 28 [2022-11-03 01:57:03,419 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 48 treesize of output 35 [2022-11-03 01:57:03,527 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:03,528 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 45 treesize of output 20 [2022-11-03 01:57:03,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:03,536 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-03 01:57:03,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:03,782 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:57:03,782 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 49 [2022-11-03 01:57:03,798 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-03 01:57:03,799 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-03 01:57:03,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:03,806 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 14 treesize of output 16 [2022-11-03 01:57:04,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:04,448 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:57:04,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 55 [2022-11-03 01:57:04,462 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 22 treesize of output 16 [2022-11-03 01:57:04,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:04,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-03 01:57:04,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:04,577 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 41 treesize of output 37 [2022-11-03 01:57:04,657 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 33 treesize of output 31 [2022-11-03 01:57:04,731 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-03 01:57:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:57:04,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:04,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3073 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3073) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-03 01:57:05,035 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-03 01:57:05,035 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 29 treesize of output 28 [2022-11-03 01:57:05,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_26| Int) (v_ArrVal_3070 (Array Int Int)) (v_ArrVal_3082 (Array Int Int)) (v_ArrVal_3072 (Array Int Int)) (v_ArrVal_3083 (Array Int Int)) (v_ArrVal_3073 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_26| v_ArrVal_3083) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (<= 0 .cse0)) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_26| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_26|) 0)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_26| v_ArrVal_3082))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (= (select (select (store (store (store .cse1 .cse2 v_ArrVal_3070) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_26| v_ArrVal_3072) (select (select .cse1 .cse2) .cse0) v_ArrVal_3073) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse2)))))) is different from false [2022-11-03 01:57:05,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386843867] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:05,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [63509275] [2022-11-03 01:57:05,676 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-03 01:57:05,677 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:57:05,677 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:57:05,677 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:57:05,677 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:57:05,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:57:05,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:57:05,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:57:05,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:57:05,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:57:05,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:05,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:05,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:05,759 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 19 treesize of output 1 [2022-11-03 01:57:05,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:05,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:57:05,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:57:05,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:57:05,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:57:05,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:57:05,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:57:05,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:05,915 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:57:05,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:57:05,943 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:05,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:05,962 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:05,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:57:05,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:06,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,010 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:57:06,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:57:06,036 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:06,045 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:06,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:06,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:06,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:57:06,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:06,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,166 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 01:57:06,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:06,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:06,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 01:57:06,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:06,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:06,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 01:57:06,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,295 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 260 treesize of output 238 [2022-11-03 01:57:06,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:06,328 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:57:06,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:57:06,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:06,356 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:57:06,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 245 [2022-11-03 01:57:06,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,472 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 260 treesize of output 238 [2022-11-03 01:57:06,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:06,501 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:57:06,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 257 [2022-11-03 01:57:06,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:06,535 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:57:06,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:57:06,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:57:06,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:06,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:06,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:06,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:06,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:57:06,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:06,905 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 19 [2022-11-03 01:57:06,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:06,932 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:06,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:57:06,956 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:06,956 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 7 [2022-11-03 01:57:06,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:06,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:06,980 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:06,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:57:07,059 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:07,059 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 7 [2022-11-03 01:57:07,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:07,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:07,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:07,088 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:07,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:57:07,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:07,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:07,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:07,110 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:07,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:57:07,145 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:07,145 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 19 [2022-11-03 01:57:07,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:07,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:57:07,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:07,432 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 01:57:07,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 01:57:07,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:57:07,481 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:57:07,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:07,553 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 01:57:07,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 01:57:07,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:57:07,619 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 01:57:07,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 01:57:07,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:57:07,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:57:07,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:57:07,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:07,935 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:57:07,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:57:07,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:07,971 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:07,982 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:07,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:08,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:57:08,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,033 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:57:08,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:57:08,060 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:08,070 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:08,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:08,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, 1 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-03 01:57:08,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:08,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:08,233 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 01:57:08,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:08,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:08,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 01:57:08,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:08,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:08,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 01:57:08,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,346 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:57:08,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:57:08,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:57:08,382 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 01:57:08,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:57:08,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:57:08,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:57:08,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:08,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:08,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:08,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:08,434 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 19 treesize of output 1 [2022-11-03 01:57:08,444 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 13 treesize of output 9 [2022-11-03 01:57:08,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:57:08,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:08,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:57:08,464 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:57:20,653 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9241#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4))) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 8) (select |#length| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (= (select |#valid| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|))' at error location [2022-11-03 01:57:20,653 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:57:20,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:57:20,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 52 [2022-11-03 01:57:20,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679194152] [2022-11-03 01:57:20,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:20,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-03 01:57:20,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:20,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-03 01:57:20,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=7293, Unknown=35, NotChecked=346, Total=8010 [2022-11-03 01:57:20,657 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 54 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 45 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-03 01:57:22,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:22,979 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2022-11-03 01:57:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 01:57:22,980 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 45 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-11-03 01:57:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:22,981 INFO L225 Difference]: With dead ends: 149 [2022-11-03 01:57:22,981 INFO L226 Difference]: Without dead ends: 149 [2022-11-03 01:57:22,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3163 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=478, Invalid=9592, Unknown=38, NotChecked=398, Total=10506 [2022-11-03 01:57:22,984 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 311 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:22,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 843 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1713 Invalid, 0 Unknown, 66 Unchecked, 1.3s Time] [2022-11-03 01:57:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-03 01:57:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 93. [2022-11-03 01:57:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:57:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-11-03 01:57:22,988 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 45 [2022-11-03 01:57:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:22,988 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-11-03 01:57:22,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 45 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-03 01:57:22,989 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-11-03 01:57:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:57:22,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:22,990 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:57:23,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:23,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-03 01:57:23,201 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:57:23,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:23,202 INFO L85 PathProgramCache]: Analyzing trace with hash -818236249, now seen corresponding path program 1 times [2022-11-03 01:57:23,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:23,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215024603] [2022-11-03 01:57:23,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:23,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:57:26,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:26,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215024603] [2022-11-03 01:57:26,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215024603] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:26,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148944321] [2022-11-03 01:57:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:26,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:26,599 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:26,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 01:57:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:26,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-03 01:57:26,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:26,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:57:26,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:27,047 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:57:27,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 01:57:27,196 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-03 01:57:27,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,365 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:57:27,365 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 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-03 01:57:27,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:27,721 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 14 treesize of output 16 [2022-11-03 01:57:27,979 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:57:27,980 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 27 treesize of output 28 [2022-11-03 01:57:28,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2022-11-03 01:57:28,219 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:28,219 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 54 treesize of output 25 [2022-11-03 01:57:28,224 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-03 01:57:28,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:28,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:28,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:28,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 01:57:28,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:28,536 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:57:28,536 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 62 treesize of output 56 [2022-11-03 01:57:28,549 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-03 01:57:28,550 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-03 01:57:28,561 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 18 treesize of output 13 [2022-11-03 01:57:29,325 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:57:29,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 67 [2022-11-03 01:57:29,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:29,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-03 01:57:29,345 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2022-11-03 01:57:29,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:29,474 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 41 treesize of output 37 [2022-11-03 01:57:29,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:29,494 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-03 01:57:29,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:29,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-11-03 01:57:29,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:29,530 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-03 01:57:29,637 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 33 treesize of output 31 [2022-11-03 01:57:29,646 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 14 treesize of output 16 [2022-11-03 01:57:29,764 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-03 01:57:29,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 15 treesize of output 7 [2022-11-03 01:57:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:57:29,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:29,928 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3325 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3325) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3325) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3326) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-03 01:57:29,940 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3325 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3323) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3325) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3324 (Array Int Int)) (v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3323) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3325) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3324) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3326) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-03 01:57:35,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148944321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:35,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [223795791] [2022-11-03 01:57:35,687 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-03 01:57:35,687 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:57:35,687 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:57:35,688 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:57:35,688 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:57:35,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:57:35,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:57:35,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:57:35,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:57:35,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:35,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:35,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:57:35,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:35,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:35,791 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 19 treesize of output 1 [2022-11-03 01:57:35,800 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 13 treesize of output 9 [2022-11-03 01:57:35,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:57:35,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:57:35,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:57:35,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:57:35,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:35,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:57:36,048 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:57:36,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:57:36,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:57:36,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:57:36,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:36,230 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:57:36,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:36,245 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:57:36,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:36,268 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:57:36,270 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:57:36,272 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:57:36,347 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:57:36,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:57:36,576 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:36,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:36,603 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:36,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:36,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:57:36,641 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:57:36,645 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:57:36,648 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:57:36,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:36,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:36,760 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 01:57:36,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:36,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:36,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:36,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:36,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 01:57:36,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:36,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:36,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:36,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:36,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 01:57:36,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:36,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 238 [2022-11-03 01:57:36,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:36,963 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:57:36,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:57:36,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:37,002 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:57:37,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 245 [2022-11-03 01:57:37,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,205 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 260 treesize of output 238 [2022-11-03 01:57:37,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:37,245 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:57:37,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:57:37,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:37,280 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:57:37,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 245 [2022-11-03 01:57:37,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:37,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:37,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:57:37,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:57:37,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:37,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:37,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:37,682 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 19 [2022-11-03 01:57:37,706 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:37,706 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 7 [2022-11-03 01:57:37,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:37,729 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:37,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:57:37,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:37,761 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:37,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:57:37,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:37,867 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:37,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:57:37,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:57:37,892 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:37,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:57:37,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:37,925 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 19 [2022-11-03 01:57:37,952 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:57:37,953 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 7 [2022-11-03 01:57:38,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:38,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:57:38,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:38,230 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:57:38,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:38,273 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 01:57:38,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 01:57:38,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:57:38,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:57:38,373 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 01:57:38,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 01:57:38,435 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 01:57:38,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 01:57:38,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:57:38,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:57:38,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:57:38,774 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:57:38,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:57:38,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:38,947 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:57:38,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:57:38,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:57:38,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:38,978 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:57:38,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:39,002 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:57:39,005 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:57:39,006 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:57:39,069 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:57:39,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:57:39,187 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:39,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:57:39,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:39,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:57:39,228 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:57:39,241 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:57:39,244 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:57:39,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:57:39,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:39,390 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:57:39,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:57:39,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:39,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:39,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:57:39,538 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 01:57:39,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:57:39,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:57:39,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:39,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:57:39,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:57:39,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:39,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:39,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:39,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:57:39,600 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 19 treesize of output 1 [2022-11-03 01:57:39,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:57:39,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:39,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:39,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:57:39,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:39,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:39,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:57:39,636 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:57:53,717 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9775#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4))) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 12) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)))) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 8) (select |#length| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (= (select |#valid| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|))' at error location [2022-11-03 01:57:53,725 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:57:53,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:57:53,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 52 [2022-11-03 01:57:53,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310067788] [2022-11-03 01:57:53,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:53,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-03 01:57:53,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:53,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-03 01:57:53,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=7811, Unknown=4, NotChecked=358, Total=8556 [2022-11-03 01:57:53,728 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 54 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 45 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-03 01:57:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:57,425 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-11-03 01:57:57,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:57:57,426 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 45 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2022-11-03 01:57:57,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:57,427 INFO L225 Difference]: With dead ends: 131 [2022-11-03 01:57:57,427 INFO L226 Difference]: Without dead ends: 131 [2022-11-03 01:57:57,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3371 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=540, Invalid=10176, Unknown=4, NotChecked=410, Total=11130 [2022-11-03 01:57:57,430 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 277 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:57,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 826 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1830 Invalid, 0 Unknown, 64 Unchecked, 2.3s Time] [2022-11-03 01:57:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-03 01:57:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 95. [2022-11-03 01:57:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.352112676056338) internal successors, (96), 89 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:57:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-11-03 01:57:57,435 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 45 [2022-11-03 01:57:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:57,435 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-11-03 01:57:57,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 45 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-03 01:57:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-11-03 01:57:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 01:57:57,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:57,437 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:57:57,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:57,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-03 01:57:57,649 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:57:57,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1324962179, now seen corresponding path program 1 times [2022-11-03 01:57:57,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:57,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806090633] [2022-11-03 01:57:57,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:57,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 01:57:58,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:58,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806090633] [2022-11-03 01:57:58,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806090633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:58,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:58,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:57:58,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694835717] [2022-11-03 01:57:58,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:58,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:57:58,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:58,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:57:58,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:57:58,015 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 9 states, 6 states have (on average 5.5) internal successors, (33), 8 states have internal predecessors, (33), 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-03 01:57:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:58,565 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2022-11-03 01:57:58,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:57:58,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 5.5) internal successors, (33), 8 states have internal predecessors, (33), 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 46 [2022-11-03 01:57:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:58,567 INFO L225 Difference]: With dead ends: 151 [2022-11-03 01:57:58,567 INFO L226 Difference]: Without dead ends: 151 [2022-11-03 01:57:58,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:57:58,568 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 128 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:58,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 349 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 01:57:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-03 01:57:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 96. [2022-11-03 01:57:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:57:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-11-03 01:57:58,575 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 46 [2022-11-03 01:57:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:58,575 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-11-03 01:57:58,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 5.5) internal successors, (33), 8 states have internal predecessors, (33), 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-03 01:57:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-11-03 01:57:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 01:57:58,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:58,577 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:57:58,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-03 01:57:58,577 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:57:58,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:58,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1324962178, now seen corresponding path program 1 times [2022-11-03 01:57:58,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:58,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9742046] [2022-11-03 01:57:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 01:57:59,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:59,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9742046] [2022-11-03 01:57:59,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9742046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:57:59,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:57:59,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:57:59,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33682662] [2022-11-03 01:57:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:57:59,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:57:59,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:59,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:57:59,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:57:59,177 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 9 states, 6 states have (on average 5.833333333333333) internal successors, (35), 8 states have internal predecessors, (35), 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-03 01:57:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:59,693 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2022-11-03 01:57:59,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:57:59,694 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 5.833333333333333) internal successors, (35), 8 states have internal predecessors, (35), 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 46 [2022-11-03 01:57:59,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:59,695 INFO L225 Difference]: With dead ends: 133 [2022-11-03 01:57:59,695 INFO L226 Difference]: Without dead ends: 133 [2022-11-03 01:57:59,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:57:59,695 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 112 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:59,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 407 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:57:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-03 01:57:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 93. [2022-11-03 01:57:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:57:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-11-03 01:57:59,699 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 46 [2022-11-03 01:57:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:59,699 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-11-03 01:57:59,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 5.833333333333333) internal successors, (35), 8 states have internal predecessors, (35), 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-03 01:57:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-11-03 01:57:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 01:57:59,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:59,700 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:57:59,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-03 01:57:59,700 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:57:59,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:59,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1373249452, now seen corresponding path program 1 times [2022-11-03 01:57:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:59,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763234668] [2022-11-03 01:57:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:59,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:57:59,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:59,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763234668] [2022-11-03 01:57:59,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763234668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:59,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088529779] [2022-11-03 01:57:59,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:59,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:59,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:59,880 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:59,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 01:58:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:00,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 01:58:00,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:00,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:58:00,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:58:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:58:00,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:58:00,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088529779] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:58:00,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [323644968] [2022-11-03 01:58:00,367 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2022-11-03 01:58:00,368 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:58:00,368 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:58:00,368 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:58:00,368 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:58:00,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:58:00,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:58:00,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:58:00,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:58:00,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:58:00,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:00,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:00,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:00,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:00,477 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 19 treesize of output 1 [2022-11-03 01:58:00,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:58:00,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:58:00,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:58:00,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:58:00,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:58:00,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:58:00,699 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:58:00,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:58:00,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,920 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:00,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:58:00,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:58:00,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:58:00,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,963 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:00,978 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:00,979 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:00,982 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:00,984 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:01,077 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:58:01,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:58:01,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:01,328 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:01,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:01,342 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:01,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:58:01,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:58:01,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:58:01,399 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:01,402 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:01,405 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:01,474 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:58:01,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 01:58:01,500 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 23 treesize of output 11 [2022-11-03 01:58:01,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:01,558 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:58:01,558 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 01:58:01,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:01,604 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:58:01,604 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:58:01,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:01,626 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 27 treesize of output 11 [2022-11-03 01:58:01,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:01,687 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 01:58:01,687 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 01:58:01,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:01,708 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 27 treesize of output 11 [2022-11-03 01:58:01,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:01,740 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:58:01,740 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 01:58:01,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:01,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:58:01,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:01,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:01,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:01,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:01,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:01,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:58:02,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:02,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:02,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:02,097 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:02,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:58:02,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:02,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:02,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:02,129 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:02,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:58:02,154 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:02,155 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 7 [2022-11-03 01:58:02,189 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:02,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, 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 19 [2022-11-03 01:58:02,359 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:02,359 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 7 [2022-11-03 01:58:02,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:02,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:02,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:02,391 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:02,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:58:02,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:02,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:02,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:02,427 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:02,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:58:02,462 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:02,462 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 19 [2022-11-03 01:58:02,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:02,793 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:58:02,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2022-11-03 01:58:02,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:02,823 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 01:58:02,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2022-11-03 01:58:02,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:58:02,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:02,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:02,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:02,904 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:02,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 40 [2022-11-03 01:58:02,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:02,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:02,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:02,928 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:02,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 42 [2022-11-03 01:58:02,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:58:03,166 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:58:03,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:58:03,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:58:03,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:58:03,427 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:58:03,441 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:58:03,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:58:03,469 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:03,471 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:03,473 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:03,550 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:58:03,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:58:03,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:58:03,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,755 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:03,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:58:03,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:03,782 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:03,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:58:03,809 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:03,812 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:03,814 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:58:03,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:58:03,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:03,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:04,048 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:58:04,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:58:04,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:04,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:04,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:58:04,196 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 65 for LOIs [2022-11-03 01:58:04,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:58:04,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:58:04,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:04,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:04,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:58:04,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:04,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:04,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:04,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:04,430 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 19 treesize of output 1 [2022-11-03 01:58:04,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:04,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:04,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:58:04,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:04,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:04,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:58:04,577 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 13 treesize of output 9 [2022-11-03 01:58:04,584 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:58:14,465 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10841#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ 4 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ 4 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ 4 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_dll_circular_insert_#t~mem16#1.base|) 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) |ULTIMATE.start_dll_circular_insert_#t~mem16#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (= |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| 0) (<= (+ |ULTIMATE.start_dll_circular_insert_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |#NULL.offset| 0) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (= 1 (select |#valid| |ULTIMATE.start_dll_circular_insert_~head#1.base|)) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= (+ 8 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (select |#length| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (<= 0 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ 4 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (= |#NULL.base| 0) (= |ULTIMATE.start_dll_circular_insert_#t~mem16#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~head#1.base|) |ULTIMATE.start_dll_circular_insert_~head#1.offset|)))' at error location [2022-11-03 01:58:14,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:58:14,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:58:14,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-11-03 01:58:14,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356673737] [2022-11-03 01:58:14,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:14,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:58:14,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:14,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:58:14,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1306, Unknown=0, NotChecked=0, Total=1482 [2022-11-03 01:58:14,468 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 01:58:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:14,711 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-11-03 01:58:14,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:58:14,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-11-03 01:58:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:14,712 INFO L225 Difference]: With dead ends: 81 [2022-11-03 01:58:14,712 INFO L226 Difference]: Without dead ends: 81 [2022-11-03 01:58:14,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2022-11-03 01:58:14,713 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:14,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 302 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:58:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-03 01:58:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-03 01:58:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 75 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:58:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-11-03 01:58:14,717 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 46 [2022-11-03 01:58:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:14,718 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-11-03 01:58:14,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 01:58:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-11-03 01:58:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 01:58:14,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:14,719 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:58:14,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:14,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:14,933 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:58:14,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:14,934 INFO L85 PathProgramCache]: Analyzing trace with hash -346017495, now seen corresponding path program 1 times [2022-11-03 01:58:14,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:14,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713317214] [2022-11-03 01:58:14,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:14,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:58:25,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:25,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713317214] [2022-11-03 01:58:25,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713317214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:25,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721448606] [2022-11-03 01:58:25,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:25,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:25,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:25,883 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:25,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 01:58:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:26,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 146 conjunts are in the unsatisfiable core [2022-11-03 01:58:26,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:26,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:58:26,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:58:26,586 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:58:26,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 01:58:26,870 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-03 01:58:27,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:58:27,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:27,152 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:58:27,152 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 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-03 01:58:27,478 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 19 treesize of output 18 [2022-11-03 01:58:27,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:27,723 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:58:27,724 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 44 treesize of output 41 [2022-11-03 01:58:27,739 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 18 treesize of output 20 [2022-11-03 01:58:28,144 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:58:28,144 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 37 treesize of output 36 [2022-11-03 01:58:28,150 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 18 treesize of output 20 [2022-11-03 01:58:28,334 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 48 treesize of output 35 [2022-11-03 01:58:28,357 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 26 [2022-11-03 01:58:28,554 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:28,555 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 56 treesize of output 27 [2022-11-03 01:58:28,561 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-03 01:58:28,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:58:28,571 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-03 01:58:29,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:29,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 01:58:29,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:29,287 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:58:29,287 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 64 treesize of output 58 [2022-11-03 01:58:29,317 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 01:58:29,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-03 01:58:29,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:58:29,349 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-03 01:58:29,349 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-03 01:58:30,668 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:58:30,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 88 [2022-11-03 01:58:30,684 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 35 treesize of output 30 [2022-11-03 01:58:30,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:30,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-11-03 01:58:30,706 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2022-11-03 01:58:30,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:30,924 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 14 treesize of output 16 [2022-11-03 01:58:30,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:30,939 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 43 treesize of output 39 [2022-11-03 01:58:30,951 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 18 treesize of output 20 [2022-11-03 01:58:30,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:30,995 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 43 treesize of output 39 [2022-11-03 01:58:31,006 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 18 treesize of output 20 [2022-11-03 01:58:31,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:31,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 01:58:31,211 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 35 treesize of output 33 [2022-11-03 01:58:31,230 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 18 treesize of output 20 [2022-11-03 01:58:31,239 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 14 treesize of output 16 [2022-11-03 01:58:31,415 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 28 treesize of output 16 [2022-11-03 01:58:31,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:58:31,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:58:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:58:31,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:31,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_4001 (Array Int Int)) (v_ArrVal_3999 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3999) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4001) |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_dll_circular_insert_~last~1#1.base| v_ArrVal_4000) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-03 01:58:31,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_4001 (Array Int Int)) (v_ArrVal_3996 (Array Int Int)) (v_ArrVal_3997 (Array Int Int)) (v_ArrVal_3998 (Array Int Int)) (v_ArrVal_3999 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3998) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3999) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4001) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3997) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4000) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-03 01:58:31,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_4001 (Array Int Int)) (v_ArrVal_3989 Int) (v_ArrVal_3991 (Array Int Int)) (v_ArrVal_3992 (Array Int Int)) (v_ArrVal_3996 (Array Int Int)) (v_ArrVal_3997 (Array Int Int)) (v_ArrVal_3998 (Array Int Int)) (v_ArrVal_3999 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_3989)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3998) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3999) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_3991) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4001) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_3992) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3997) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4000) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-03 01:58:32,019 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3989 Int) (v_ArrVal_4001 (Array Int Int)) (v_ArrVal_3991 (Array Int Int)) (v_ArrVal_3992 (Array Int Int)) (v_ArrVal_3996 (Array Int Int)) (v_ArrVal_3997 (Array Int Int)) (v_ArrVal_3998 (Array Int Int)) (v_ArrVal_3999 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_3989)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3998) .cse0 v_ArrVal_3999) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_3991) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3996) .cse0 v_ArrVal_4001) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_3992) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3997) .cse0 v_ArrVal_4000) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-03 01:58:32,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_4001 (Array Int Int)) (v_ArrVal_3989 Int) (v_ArrVal_3991 (Array Int Int)) (v_ArrVal_3992 (Array Int Int)) (v_ArrVal_3996 (Array Int Int)) (v_ArrVal_3997 (Array Int Int)) (v_ArrVal_3998 (Array Int Int)) (v_ArrVal_3999 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_3989)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3998) .cse0 v_ArrVal_3999) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3991) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3996) .cse0 v_ArrVal_4001) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_3992) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3997) .cse0 v_ArrVal_4000) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-03 01:58:32,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_4001 (Array Int Int)) (v_ArrVal_3989 Int) (v_ArrVal_3991 (Array Int Int)) (v_ArrVal_3992 (Array Int Int)) (v_ArrVal_3996 (Array Int Int)) (v_ArrVal_3997 (Array Int Int)) (v_ArrVal_3998 (Array Int Int)) (v_ArrVal_3999 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_3989)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3998) .cse2 v_ArrVal_3999) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3991) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3996) .cse2 v_ArrVal_4001) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3992) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_3997) .cse2 v_ArrVal_4000) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2022-11-03 01:58:32,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_4001 (Array Int Int)) (v_ArrVal_3989 Int) (v_ArrVal_3991 (Array Int Int)) (v_ArrVal_3992 (Array Int Int)) (v_ArrVal_3996 (Array Int Int)) (v_ArrVal_3997 (Array Int Int)) (v_ArrVal_3998 (Array Int Int)) (v_ArrVal_3999 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_3989)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_3998) .cse2 v_ArrVal_3999) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3991) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_3996) .cse2 v_ArrVal_4001) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3992) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_3997) .cse2 v_ArrVal_4000) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-03 01:58:32,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_36| Int) (v_ArrVal_3989 Int) (v_ArrVal_4000 (Array Int Int)) (v_ArrVal_4001 (Array Int Int)) (v_ArrVal_3991 (Array Int Int)) (v_ArrVal_4014 (Array Int Int)) (v_ArrVal_3992 (Array Int Int)) (v_ArrVal_4015 (Array Int Int)) (v_ArrVal_4016 (Array Int Int)) (v_ArrVal_3996 (Array Int Int)) (v_ArrVal_3997 (Array Int Int)) (v_ArrVal_3998 (Array Int Int)) (v_ArrVal_3999 (Array Int Int))) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_36|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_36| v_ArrVal_4014)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_36| v_ArrVal_4015))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select (select .cse4 .cse1) .cse2))) (select (select (store (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_36| v_ArrVal_4016))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3989))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3998) .cse3 v_ArrVal_3999) (select (select (store (store (store .cse4 .cse1 v_ArrVal_3991) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3996) .cse3 v_ArrVal_4001) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store .cse5 .cse1 v_ArrVal_3992) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_36| v_ArrVal_3997) .cse3 v_ArrVal_4000) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))))) is different from false [2022-11-03 01:58:32,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721448606] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:32,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1368854892] [2022-11-03 01:58:32,228 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-03 01:58:32,229 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:58:32,229 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:58:32,230 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:58:32,230 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:58:32,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:58:32,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:58:32,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:58:32,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:58:32,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:32,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:58:32,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:32,327 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 19 treesize of output 1 [2022-11-03 01:58:32,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:32,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:32,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 13 treesize of output 9 [2022-11-03 01:58:32,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:58:32,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:58:32,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:58:32,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:58:32,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:58:32,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,532 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:58:32,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:58:32,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:58:32,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,590 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:32,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:58:32,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,615 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:32,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:58:32,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,660 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:58:32,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:58:32,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,704 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:32,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:58:32,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:58:32,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:58:32,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,751 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:32,842 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:32,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,844 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 01:58:32,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:32,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:32,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 01:58:32,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:32,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:32,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 01:58:32,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:32,996 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 260 treesize of output 238 [2022-11-03 01:58:33,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:33,034 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:58:33,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 257 [2022-11-03 01:58:33,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:33,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:33,083 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:58:33,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:58:33,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:33,251 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 260 treesize of output 238 [2022-11-03 01:58:33,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:33,296 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:58:33,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:58:33,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:33,347 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:58:33,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 245 [2022-11-03 01:58:33,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:58:33,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:33,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:33,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:58:33,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:33,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:33,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:33,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:33,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:33,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:33,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:33,797 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:33,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:58:33,823 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:33,824 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 7 [2022-11-03 01:58:33,857 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:33,857 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 19 [2022-11-03 01:58:33,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:33,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:33,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:33,893 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:33,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:58:34,016 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:34,016 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 19 [2022-11-03 01:58:34,047 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:34,047 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 7 [2022-11-03 01:58:34,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:34,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:34,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:34,072 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:34,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:58:34,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:34,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:34,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:34,101 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:58:34,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:58:34,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:34,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:58:34,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:34,472 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 01:58:34,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 01:58:34,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:58:34,539 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:58:34,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:34,634 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 01:58:34,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 01:58:34,687 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 01:58:34,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 01:58:34,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:58:34,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:58:35,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:58:35,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:58:35,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:35,683 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:58:35,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:58:35,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:58:35,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:35,730 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:35,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:58:35,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:35,755 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:35,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:58:35,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:35,804 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:58:35,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:58:35,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:35,839 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:35,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:58:35,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:58:35,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:35,880 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:58:35,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:58:36,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:36,087 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 01:58:36,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:36,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:36,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:36,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:36,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 01:58:36,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:36,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:36,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:58:36,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 01:58:36,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:36,200 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:58:36,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 01:58:36,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:36,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:36,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:58:36,240 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2022-11-03 01:58:36,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:58:36,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:58:36,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:58:36,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:36,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:58:36,282 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 19 treesize of output 1 [2022-11-03 01:58:36,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:36,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:36,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:36,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:58:36,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:36,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:36,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:58:36,321 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 13 treesize of output 9 [2022-11-03 01:58:36,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:36,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:36,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:58:36,336 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:58:55,986 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11297#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4))) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= (+ |ULTIMATE.start_main_~#s~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 12) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|)) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 8) (select |#length| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (= (select |#valid| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)) |ULTIMATE.start_main_~data~0#1|)) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)))' at error location [2022-11-03 01:58:55,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:58:55,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:58:55,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30] total 60 [2022-11-03 01:58:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731104846] [2022-11-03 01:58:55,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:55,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-03 01:58:55,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:55,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-03 01:58:55,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=7834, Unknown=13, NotChecked=1480, Total=9702 [2022-11-03 01:58:55,989 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 61 states, 51 states have (on average 1.588235294117647) internal successors, (81), 52 states have internal predecessors, (81), 6 states have call successors, (6), 2 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-03 01:59:04,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:04,485 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2022-11-03 01:59:04,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:59:04,486 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 51 states have (on average 1.588235294117647) internal successors, (81), 52 states have internal predecessors, (81), 6 states have call successors, (6), 2 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 47 [2022-11-03 01:59:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:04,486 INFO L225 Difference]: With dead ends: 119 [2022-11-03 01:59:04,486 INFO L226 Difference]: Without dead ends: 119 [2022-11-03 01:59:04,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3100 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=569, Invalid=11221, Unknown=14, NotChecked=1768, Total=13572 [2022-11-03 01:59:04,488 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 245 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:04,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1092 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1770 Invalid, 0 Unknown, 106 Unchecked, 2.8s Time] [2022-11-03 01:59:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-03 01:59:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2022-11-03 01:59:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 79 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:59:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-11-03 01:59:04,492 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 47 [2022-11-03 01:59:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:04,493 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-11-03 01:59:04,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 51 states have (on average 1.588235294117647) internal successors, (81), 52 states have internal predecessors, (81), 6 states have call successors, (6), 2 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-03 01:59:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-11-03 01:59:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-03 01:59:04,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:04,494 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:59:04,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 01:59:04,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:59:04,709 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:59:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:04,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1978330816, now seen corresponding path program 1 times [2022-11-03 01:59:04,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:59:04,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981585820] [2022-11-03 01:59:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:04,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:59:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:59:05,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:59:05,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981585820] [2022-11-03 01:59:05,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981585820] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:59:05,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378509114] [2022-11-03 01:59:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:05,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:59:05,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:59:05,460 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:59:05,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 01:59:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:05,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 01:59:05,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:05,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:59:06,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:59:06,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:59:06,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:59:06,347 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-03 01:59:06,347 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-03 01:59:06,384 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-03 01:59:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 01:59:06,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:59:06,469 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-03 01:59:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:59:07,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378509114] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:59:07,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:59:07,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16, 10] total 28 [2022-11-03 01:59:07,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896588987] [2022-11-03 01:59:07,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:59:07,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:59:07,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:59:07,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:59:07,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2022-11-03 01:59:07,099 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 01:59:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:07,338 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-11-03 01:59:07,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:59:07,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-11-03 01:59:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:07,340 INFO L225 Difference]: With dead ends: 78 [2022-11-03 01:59:07,340 INFO L226 Difference]: Without dead ends: 76 [2022-11-03 01:59:07,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2022-11-03 01:59:07,341 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 113 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:07,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 140 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:59:07,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-03 01:59:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-03 01:59:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:59:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-11-03 01:59:07,344 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 48 [2022-11-03 01:59:07,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:07,344 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-11-03 01:59:07,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 01:59:07,344 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-11-03 01:59:07,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 01:59:07,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:07,345 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:59:07,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-03 01:59:07,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-03 01:59:07,565 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:59:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:07,566 INFO L85 PathProgramCache]: Analyzing trace with hash -282437712, now seen corresponding path program 1 times [2022-11-03 01:59:07,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:59:07,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635657819] [2022-11-03 01:59:07,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:07,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:59:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:59:11,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:59:11,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635657819] [2022-11-03 01:59:11,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635657819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:59:11,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55087806] [2022-11-03 01:59:11,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:11,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:59:11,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:59:11,634 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:59:11,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 01:59:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:12,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-03 01:59:12,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:12,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:59:12,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:59:12,271 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:59:12,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 01:59:12,441 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-03 01:59:12,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:12,662 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:59:12,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-03 01:59:12,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:13,141 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:59:13,142 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 43 treesize of output 40 [2022-11-03 01:59:13,464 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:59:13,464 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 36 treesize of output 35 [2022-11-03 01:59:13,604 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 61 treesize of output 40 [2022-11-03 01:59:13,808 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:59:13,809 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 58 treesize of output 25 [2022-11-03 01:59:13,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:59:13,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:13,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:59:14,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:14,514 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:59:14,514 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 66 treesize of output 56 [2022-11-03 01:59:14,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:14,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:14,580 INFO L356 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-03 01:59:14,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 65 [2022-11-03 01:59:14,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:14,622 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-03 01:59:15,774 INFO L356 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-03 01:59:15,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 72 [2022-11-03 01:59:15,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:15,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-03 01:59:15,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:15,988 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-03 01:59:16,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:16,015 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:59:16,016 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 52 [2022-11-03 01:59:16,080 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-03 01:59:16,080 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 82 [2022-11-03 01:59:16,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:16,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-03 01:59:16,285 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-03 01:59:16,301 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:59:16,301 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 87 treesize of output 69 [2022-11-03 01:59:16,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:59:16,826 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:59:16,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 39 [2022-11-03 01:59:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:59:17,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:59:17,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4482 (Array Int Int)) (v_ArrVal_4481 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4482))) (select .cse0 (select (select .cse0 |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_dll_circular_insert_~last~1#1.base| v_ArrVal_4481) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-03 01:59:17,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4482 (Array Int Int)) (v_ArrVal_4476 (Array Int Int)) (v_ArrVal_4479 (Array Int Int)) (v_ArrVal_4480 (Array Int Int)) (v_ArrVal_4481 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4479) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4482))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_4476) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4480) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4481) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-03 01:59:17,507 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4482 (Array Int Int)) (v_ArrVal_4476 (Array Int Int)) (v_ArrVal_4479 (Array Int Int)) (v_ArrVal_4480 (Array Int Int)) (v_ArrVal_4481 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4479) .cse1 v_ArrVal_4482))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_4476) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4480) .cse1 v_ArrVal_4481) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 1)) is different from false [2022-11-03 01:59:18,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4493 (Array Int Int)) (v_ArrVal_4482 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_43| Int) (v_ArrVal_4476 (Array Int Int)) (v_ArrVal_4479 (Array Int Int)) (v_ArrVal_4480 (Array Int Int)) (v_ArrVal_4492 (Array Int Int)) (v_ArrVal_4481 (Array Int Int))) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_43| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_43|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_43| 1) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_43| v_ArrVal_4493))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_43| v_ArrVal_4492)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse5 (select .cse3 .cse4))) (select (let ((.cse0 (store (store (store .cse1 .cse2 (store .cse3 .cse4 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_43|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_43| v_ArrVal_4479) .cse5 v_ArrVal_4482))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse6 .cse2 v_ArrVal_4476) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_43| v_ArrVal_4480) .cse5 v_ArrVal_4481) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) 1))) is different from false [2022-11-03 01:59:18,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55087806] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:59:18,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [155846193] [2022-11-03 01:59:18,924 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-03 01:59:18,924 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:59:18,924 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:59:18,925 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:59:18,925 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:59:18,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:18,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:18,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 01:59:18,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:18,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:18,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:59:18,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:59:18,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:59:19,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:19,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:19,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:59:19,025 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 19 treesize of output 1 [2022-11-03 01:59:19,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:59:19,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:59:19,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:59:19,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:59:19,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:59:19,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:59:19,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:59:19,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 01:59:19,288 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:59:19,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:59:19,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-03 01:59:19,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:59:19,524 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:59:19,537 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:59:19,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:59:19,563 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:19,565 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:19,568 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:19,637 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:59:19,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:59:19,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,771 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:59:19,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:59:19,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,795 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 01:59:19,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 01:59:19,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:59:19,838 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:19,840 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:19,842 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:19,844 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:19,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:19,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,961 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 01:59:19,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:19,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:19,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:19,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 01:59:20,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:20,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:20,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:20,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:20,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 01:59:20,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:20,112 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 260 treesize of output 238 [2022-11-03 01:59:20,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:20,152 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:59:20,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 257 [2022-11-03 01:59:20,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:20,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:20,202 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:59:20,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:59:20,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:20,331 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 260 treesize of output 238 [2022-11-03 01:59:20,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:20,379 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:59:20,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 01:59:20,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:20,419 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:59:20,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 245 [2022-11-03 01:59:20,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:20,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:20,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:59:20,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:20,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:59:20,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:59:20,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:20,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:59:20,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:20,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:20,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:20,874 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:59:20,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:59:20,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:59:20,906 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 19 [2022-11-03 01:59:20,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:20,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:20,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:20,952 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:59:20,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:59:20,977 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:59:20,978 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 7 [2022-11-03 01:59:21,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:21,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:21,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:21,085 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:59:21,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:59:21,121 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:59:21,122 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 7 [2022-11-03 01:59:21,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:59:21,150 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 19 [2022-11-03 01:59:21,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:21,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:21,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:59:21,189 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:59:21,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 01:59:21,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:21,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:21,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:59:21,602 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 01:59:21,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 01:59:21,647 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 01:59:21,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:59:21,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:59:21,749 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 01:59:21,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 01:59:21,813 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 01:59:21,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 01:59:21,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:59:21,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 01:59:21,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:59:21,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:59:23,097 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:59:23,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:59:23,257 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:59:23,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:59:23,282 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:59:23,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:59:23,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:59:23,325 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:23,328 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:23,330 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:23,417 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:59:23,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:59:23,598 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:59:23,619 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 01:59:23,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:59:23,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 01:59:23,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:59:23,677 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:23,680 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:23,682 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 01:59:23,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:23,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:59:23,858 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 01:59:23,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 01:59:24,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:24,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:24,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 01:59:24,032 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 01:59:24,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 01:59:24,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:59:24,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:59:24,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:24,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:24,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:24,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:59:24,095 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 19 treesize of output 1 [2022-11-03 01:59:24,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:24,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:59:24,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:24,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:24,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:59:24,123 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 13 treesize of output 9 [2022-11-03 01:59:24,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:24,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:24,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 01:59:24,135 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:59:40,331 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12307#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|))' at error location [2022-11-03 01:59:40,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:59:40,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:59:40,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 58 [2022-11-03 01:59:40,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280701448] [2022-11-03 01:59:40,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 01:59:40,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-03 01:59:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:59:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-03 01:59:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=8506, Unknown=220, NotChecked=764, Total=9900 [2022-11-03 01:59:40,334 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 60 states, 50 states have (on average 1.74) internal successors, (87), 51 states have internal predecessors, (87), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-03 01:59:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:59:42,897 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-11-03 01:59:42,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 01:59:42,906 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 50 states have (on average 1.74) internal successors, (87), 51 states have internal predecessors, (87), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-11-03 01:59:42,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:59:42,907 INFO L225 Difference]: With dead ends: 79 [2022-11-03 01:59:42,907 INFO L226 Difference]: Without dead ends: 79 [2022-11-03 01:59:42,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3482 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=525, Invalid=10381, Unknown=240, NotChecked=844, Total=11990 [2022-11-03 01:59:42,909 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 37 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:59:42,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 579 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1036 Invalid, 0 Unknown, 106 Unchecked, 1.2s Time] [2022-11-03 01:59:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-03 01:59:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-03 01:59:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 73 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 01:59:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-11-03 01:59:42,914 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 50 [2022-11-03 01:59:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:59:42,915 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-11-03 01:59:42,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 50 states have (on average 1.74) internal successors, (87), 51 states have internal predecessors, (87), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-03 01:59:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-11-03 01:59:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 01:59:42,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:59:42,916 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:59:42,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 01:59:43,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:59:43,129 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 01:59:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:59:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash -282437711, now seen corresponding path program 1 times [2022-11-03 01:59:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:59:43,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19682629] [2022-11-03 01:59:43,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:43,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:59:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:59:46,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:59:46,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19682629] [2022-11-03 01:59:46,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19682629] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:59:46,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33544524] [2022-11-03 01:59:46,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:59:46,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:59:46,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:59:46,652 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:59:46,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 01:59:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:59:47,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 130 conjunts are in the unsatisfiable core [2022-11-03 01:59:47,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:47,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:59:47,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:59:47,201 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |c_#valid|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from false [2022-11-03 01:59:47,205 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |c_#valid|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1)) is different from true [2022-11-03 01:59:47,232 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |c_#valid|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from false [2022-11-03 01:59:47,236 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |c_#valid|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) is different from true [2022-11-03 01:59:47,282 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|)))) is different from false [2022-11-03 01:59:47,285 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|)))) is different from true [2022-11-03 01:59:47,318 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|)))) is different from false [2022-11-03 01:59:47,321 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|)))) is different from true [2022-11-03 01:59:47,443 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|)))) is different from false [2022-11-03 01:59:47,446 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|)))) is different from true [2022-11-03 01:59:47,518 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)))) is different from false [2022-11-03 01:59:47,522 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)))) is different from true [2022-11-03 01:59:47,612 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from false [2022-11-03 01:59:47,616 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from true [2022-11-03 01:59:47,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 01:59:47,696 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2022-11-03 01:59:47,701 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from true [2022-11-03 01:59:47,801 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:59:47,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-03 01:59:47,899 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_295| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_293| .cse1) 0))))) is different from false [2022-11-03 01:59:47,904 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_295| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_293| .cse1) 0))))) is different from true [2022-11-03 01:59:47,996 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_293| .cse1) 0))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|))) is different from false [2022-11-03 01:59:48,001 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_293| .cse1) 0))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-03 01:59:48,121 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:59:48,121 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 29 treesize of output 30 [2022-11-03 01:59:48,183 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_293| .cse1) 0)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|)) is different from false [2022-11-03 01:59:48,187 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_293| .cse1) 0)))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-11-03 01:59:48,242 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 46 treesize of output 33 [2022-11-03 01:59:48,290 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (= (select |v_#valid_BEFORE_CALL_295| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= (select |v_#valid_BEFORE_CALL_295| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_293| .cse3) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| .cse1 1))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< .cse1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2022-11-03 01:59:48,295 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (= (select |v_#valid_BEFORE_CALL_295| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= (select |v_#valid_BEFORE_CALL_295| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_293| .cse3) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| .cse1 1))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< .cse1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from true [2022-11-03 01:59:48,349 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:59:48,350 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 43 treesize of output 22 [2022-11-03 01:59:48,359 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-03 01:59:48,414 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2022-11-03 01:59:48,421 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from true [2022-11-03 01:59:48,498 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-03 01:59:48,503 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-03 01:59:48,657 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (exists ((v_ArrVal_4724 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4724) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_4723 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4723) |c_#memory_$Pointer$.base|))) is different from false [2022-11-03 01:59:48,662 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (exists ((v_ArrVal_4724 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4724) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_4723 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4723) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:59:48,745 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (exists ((v_ArrVal_4726 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4726) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_4725 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4725) |c_#memory_$Pointer$.base|))) is different from false [2022-11-03 01:59:48,750 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (exists ((v_ArrVal_4726 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4726) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_ArrVal_4725 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4725) |c_#memory_$Pointer$.base|))) is different from true [2022-11-03 01:59:48,833 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_4728 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4728))) (<= (+ |c_node_create_#res#1.offset| 12) (select |c_#length| |c_node_create_#res#1.base|)) (exists ((v_ArrVal_4727 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_4727)))) is different from false [2022-11-03 01:59:48,838 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_4728 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4728))) (<= (+ |c_node_create_#res#1.offset| 12) (select |c_#length| |c_node_create_#res#1.base|)) (exists ((v_ArrVal_4727 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_4727)))) is different from true [2022-11-03 01:59:48,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:48,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 01:59:48,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:48,939 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:59:48,939 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 81 treesize of output 73 [2022-11-03 01:59:49,181 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse1)) (.cse4 (+ 2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_300| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse2) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse3 (select |v_#valid_BEFORE_CALL_300| .cse3)))) (= (select (store |v_#valid_BEFORE_CALL_300| .cse1 1) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_37))) (and (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_294| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse6 (select |v_#valid_BEFORE_CALL_294| .cse6)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse7 (select |v_#valid_BEFORE_CALL_295| .cse7)))) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|))))))) is different from false [2022-11-03 01:59:49,187 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse1)) (.cse4 (+ 2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_300| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse2) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse3 (select |v_#valid_BEFORE_CALL_300| .cse3)))) (= (select (store |v_#valid_BEFORE_CALL_300| .cse1 1) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_37))) (and (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_294| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse6 (select |v_#valid_BEFORE_CALL_294| .cse6)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse7 (select |v_#valid_BEFORE_CALL_295| .cse7)))) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|))))))) is different from true [2022-11-03 01:59:49,426 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse5 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse6) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse7 (select |v_#valid_BEFORE_CALL_300| .cse7))))))) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from false [2022-11-03 01:59:49,432 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse5 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse6) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse7 (select |v_#valid_BEFORE_CALL_300| .cse7))))))) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from true [2022-11-03 01:59:49,717 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse6)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse6) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse5) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse6) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse6 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse7) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse8 (select |v_#valid_BEFORE_CALL_300| .cse8))))))) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from false [2022-11-03 01:59:49,723 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse6)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse6) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse5) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse6) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse6 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse7) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse8 (select |v_#valid_BEFORE_CALL_300| .cse8))))))) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from true [2022-11-03 01:59:50,004 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse6)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse6) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse5) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse6) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse6 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse7) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse8 (select |v_#valid_BEFORE_CALL_300| .cse8))))))) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from false [2022-11-03 01:59:50,010 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse6)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse6) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse5) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse6) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse6 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse7) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse8 (select |v_#valid_BEFORE_CALL_300| .cse8))))))) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from true [2022-11-03 01:59:50,298 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse7)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.base| .cse7))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 .cse2) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse3 (+ 2 v_arrayElimIndex_37))) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse4 (select |v_#valid_BEFORE_CALL_294| .cse4)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse6 (select |v_#valid_BEFORE_CALL_295| .cse6)))) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse2) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse7) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse8 (select .cse1 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse7 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse8) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse9 (select |v_#valid_BEFORE_CALL_300| .cse9))))))) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from false [2022-11-03 01:59:50,305 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse7)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.base| .cse7))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 .cse2) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse3 (+ 2 v_arrayElimIndex_37))) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse4 (select |v_#valid_BEFORE_CALL_294| .cse4)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse6 (select |v_#valid_BEFORE_CALL_295| .cse6)))) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse2) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse7) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse8 (select .cse1 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse7 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse8) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse9 (select |v_#valid_BEFORE_CALL_300| .cse9))))))) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from true [2022-11-03 01:59:50,880 INFO L356 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-03 01:59:50,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 88 [2022-11-03 01:59:50,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:50,924 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 0 case distinctions, treesize of input 46 treesize of output 36 [2022-11-03 01:59:51,118 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse5) 0)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse5 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_300| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_300| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse6 (select |v_#valid_BEFORE_CALL_300| .cse6)))) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse5) 0)) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from false [2022-11-03 01:59:51,125 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse5) 0)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse5 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_300| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_300| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse6 (select |v_#valid_BEFORE_CALL_300| .cse6)))) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse5) 0)) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from true [2022-11-03 01:59:51,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:51,226 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:59:51,227 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 77 treesize of output 73 [2022-11-03 01:59:51,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:51,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:51,291 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 01:59:51,291 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 25 treesize of output 38 [2022-11-03 01:59:51,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 01:59:51,465 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse5) 0)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse5 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_300| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_300| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse6 (select |v_#valid_BEFORE_CALL_300| .cse6)))) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0))) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse5) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse5) 0))) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from false [2022-11-03 01:59:51,470 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse5) 0)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse5 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_300| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_300| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse6 (select |v_#valid_BEFORE_CALL_300| .cse6)))) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0))) (or (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse5) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse5) 0))) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from true [2022-11-03 01:59:51,604 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-03 01:59:51,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 121 [2022-11-03 01:59:51,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:51,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:51,754 INFO L356 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-03 01:59:51,755 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 49 treesize of output 70 [2022-11-03 01:59:51,775 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 23 treesize of output 19 [2022-11-03 01:59:51,868 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (let ((.cse0 (+ 2 .cse3)) (.cse8 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse2 (select |c_#length| .cse4))) (or (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse3) 0))) (and (<= 0 .cse1) (<= (+ .cse1 12) .cse2))) (and (= .cse4 .cse3) (<= 12 .cse2)))) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_37))) (and (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse6 (select |v_#valid_BEFORE_CALL_294| .cse6)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse7 (select |v_#valid_BEFORE_CALL_295| .cse7)))) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse8 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_300| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_300| .cse3 1) .cse4) 0) (= (select |v_#valid_BEFORE_CALL_300| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_300| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse9 (select |v_#valid_BEFORE_CALL_300| .cse9)))) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0))))))) is different from false [2022-11-03 01:59:51,874 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (let ((.cse0 (+ 2 .cse3)) (.cse8 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse2 (select |c_#length| .cse4))) (or (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse3) 0))) (and (<= 0 .cse1) (<= (+ .cse1 12) .cse2))) (and (= .cse4 .cse3) (<= 12 .cse2)))) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_37))) (and (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse6 (select |v_#valid_BEFORE_CALL_294| .cse6)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse7 (select |v_#valid_BEFORE_CALL_295| .cse7)))) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse8 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_300| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_300| .cse3 1) .cse4) 0) (= (select |v_#valid_BEFORE_CALL_300| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_300| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse9 (select |v_#valid_BEFORE_CALL_300| .cse9)))) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0))))))) is different from true [2022-11-03 01:59:51,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:51,973 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 01:59:51,973 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 167 treesize of output 123 [2022-11-03 01:59:52,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:52,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:52,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:52,080 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 78 [2022-11-03 01:59:52,248 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (let ((.cse0 (+ 2 .cse3)) (.cse8 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse2 (select |c_#length| .cse4))) (or (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse3) 0))) (and (<= 0 .cse1) (<= (+ .cse1 12) .cse2))) (and (= .cse4 .cse3) (<= 12 .cse2)))) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_37))) (and (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse6 (select |v_#valid_BEFORE_CALL_294| .cse6)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse7 (select |v_#valid_BEFORE_CALL_295| .cse7)))) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse8 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_300| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_300| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_300| .cse3 1) .cse4) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse9 (select |v_#valid_BEFORE_CALL_300| .cse9)))))))))) is different from false [2022-11-03 01:59:52,255 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (let ((.cse0 (+ 2 .cse3)) (.cse8 (+ 2 .cse4))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse2 (select |c_#length| .cse4))) (or (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse3) 0))) (and (<= 0 .cse1) (<= (+ .cse1 12) .cse2))) (and (= .cse4 .cse3) (<= 12 .cse2)))) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (let ((.cse5 (+ 2 v_arrayElimIndex_37))) (and (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse6 (select |v_#valid_BEFORE_CALL_294| .cse6)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse7 (select |v_#valid_BEFORE_CALL_295| .cse7)))) (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse8 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_300| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_300| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_300| .cse3 1) .cse4) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse9 (select |v_#valid_BEFORE_CALL_300| .cse9)))))))))) is different from true [2022-11-03 01:59:53,234 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (v_arrayElimCell_1747 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse0) 0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 v_arrayElimIndex_37)) (.cse1 (+ 2 .cse6)) (.cse3 (+ .cse0 2))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_300| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_300| .cse0) 0) (<= 0 .cse4) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (<= (+ 12 .cse4) (select |c_#length| .cse6)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_294| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse7 (select |v_#valid_BEFORE_CALL_294| .cse7)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse8 (select |v_#valid_BEFORE_CALL_295| .cse8)))) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= .cse5 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse0 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_300| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse9 (select |v_#valid_BEFORE_CALL_300| .cse9)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)))))) is different from false [2022-11-03 01:59:55,899 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (v_arrayElimCell_1747 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse0) 0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 v_arrayElimIndex_37)) (.cse1 (+ 2 .cse6)) (.cse3 (+ .cse0 2))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_300| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_300| .cse0) 0) (<= 0 .cse4) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (<= (+ 12 .cse4) (select |c_#length| .cse6)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_294| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse7 (select |v_#valid_BEFORE_CALL_294| .cse7)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse8 (select |v_#valid_BEFORE_CALL_295| .cse8)))) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= .cse5 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse0 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_300| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse9 (select |v_#valid_BEFORE_CALL_300| .cse9)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)))))) is different from true [2022-11-03 01:59:56,752 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-03 01:59:56,752 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 82 [2022-11-03 01:59:56,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:56,818 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-03 01:59:56,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 23 [2022-11-03 01:59:57,188 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (v_arrayElimCell_1747 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_37)) (.cse4 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse0 (+ 2 v_arrayElimIndex_45))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_300| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| v_arrayElimIndex_45 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse3 (select |v_#valid_BEFORE_CALL_295| .cse3)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_300| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse5 (select |v_#valid_BEFORE_CALL_300| .cse5)))) (= (select |v_#valid_BEFORE_CALL_300| v_arrayElimIndex_45) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|)))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) is different from false [2022-11-03 01:59:57,194 WARN L855 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (v_arrayElimCell_1747 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (let ((.cse1 (+ 2 v_arrayElimIndex_37)) (.cse4 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse0 (+ 2 v_arrayElimIndex_45))) (and (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_300| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| v_arrayElimIndex_45 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse3 (select |v_#valid_BEFORE_CALL_295| .cse3)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse4 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_300| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse5 (select |v_#valid_BEFORE_CALL_300| .cse5)))) (= (select |v_#valid_BEFORE_CALL_300| v_arrayElimIndex_45) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|)))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|)) is different from true [2022-11-03 01:59:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2022-11-03 01:59:57,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:59:57,928 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4737 (Array Int Int)) (v_ArrVal_4738 (Array Int Int))) (<= 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4737))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4738) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 8))) (forall ((v_ArrVal_4737 (Array Int Int)) (v_ArrVal_4738 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4737)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4738))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse1 .cse2) .cse3) 12) (select |c_#length| (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-03 01:59:59,763 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:59:59,764 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 633 treesize of output 637 [2022-11-03 02:00:04,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33544524] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:00:04,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [385302490] [2022-11-03 02:00:04,912 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-03 02:00:04,912 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:00:04,912 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:00:04,913 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:00:04,913 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:00:04,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:04,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:04,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:00:04,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:04,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:04,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:00:04,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:00:04,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:00:05,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:05,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:00:05,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:05,024 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 19 treesize of output 1 [2022-11-03 02:00:05,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:05,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:05,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:00:05,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:00:05,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:00:05,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:00:05,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:00:05,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:00:05,288 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 02:00:05,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 02:00:05,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 02:00:05,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:00:05,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:00:05,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,538 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:00:05,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,554 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:00:05,568 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:05,571 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:05,574 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:05,669 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 02:00:05,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 02:00:05,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:00:05,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,880 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:00:05,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:05,894 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:00:05,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:00:05,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 02:00:05,933 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:05,935 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:05,936 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:05,938 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:06,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:06,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,035 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 02:00:06,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:06,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:06,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 02:00:06,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:06,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:06,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 02:00:06,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,181 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 260 treesize of output 238 [2022-11-03 02:00:06,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:06,229 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 02:00:06,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 02:00:06,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:06,261 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 02:00:06,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 245 [2022-11-03 02:00:06,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,430 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 260 treesize of output 238 [2022-11-03 02:00:06,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:06,468 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 02:00:06,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 02:00:06,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:06,503 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 02:00:06,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 245 [2022-11-03 02:00:06,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:00:06,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:06,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:06,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:00:06,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:06,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:06,840 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:06,840 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 7 [2022-11-03 02:00:06,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:00:06,866 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 19 [2022-11-03 02:00:06,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:06,902 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:06,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:00:06,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:06,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:06,947 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:06,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:00:07,030 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:07,030 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 7 [2022-11-03 02:00:07,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:07,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:07,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:07,054 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:07,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:00:07,090 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:00:07,091 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 19 [2022-11-03 02:00:07,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:07,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:07,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:07,125 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:07,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:00:07,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:07,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:07,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:00:07,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:00:07,432 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:00:07,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:07,481 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:00:07,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 02:00:07,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:07,552 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:00:07,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 02:00:07,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:00:07,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:07,618 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:00:07,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 02:00:07,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:07,809 INFO L356 Elim1Store]: treesize reduction 54, result has 59.1 percent of original size [2022-11-03 02:00:07,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 113 [2022-11-03 02:00:07,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:00:07,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:07,987 INFO L356 Elim1Store]: treesize reduction 100, result has 24.2 percent of original size [2022-11-03 02:00:07,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 58 [2022-11-03 02:00:08,007 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-11-03 02:00:08,053 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-11-03 02:00:11,169 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-11-03 02:00:11,335 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 02:00:11,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 02:00:11,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:00:11,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:11,459 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:00:11,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:00:11,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:11,487 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:00:11,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 02:00:11,516 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:11,518 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:11,521 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:11,602 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 02:00:11,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 02:00:11,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:00:11,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 02:00:11,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:00:11,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:11,879 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:00:11,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:11,895 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:00:11,910 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:11,912 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:11,913 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:11,916 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:12,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:12,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,080 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 02:00:12,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:12,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:12,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 02:00:12,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:12,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,123 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:12,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 02:00:12,235 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 02:00:12,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 02:00:12,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:00:12,483 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 02:00:12,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:00:12,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:00:12,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:12,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:12,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:00:12,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:12,548 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 19 treesize of output 1 [2022-11-03 02:00:12,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:12,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:00:12,579 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 13 treesize of output 9 [2022-11-03 02:00:12,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:12,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:00:12,593 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:00:29,429 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12797#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 12) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)))) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|))' at error location [2022-11-03 02:00:29,429 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:00:29,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:00:29,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 61 [2022-11-03 02:00:29,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947740672] [2022-11-03 02:00:29,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:00:29,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-03 02:00:29,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:00:29,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-03 02:00:29,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=5421, Unknown=67, NotChecked=5104, Total=10920 [2022-11-03 02:00:29,431 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 63 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 52 states have internal predecessors, (86), 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-03 02:00:30,341 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |c_#valid|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-03 02:00:30,344 WARN L855 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |c_#valid|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-03 02:00:30,350 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |c_#valid|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-03 02:00:30,353 WARN L855 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_293| |c_#valid|))) (store |v_#valid_BEFORE_CALL_293| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-03 02:00:30,359 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_294| .cse1)))) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))))) is different from false [2022-11-03 02:00:30,362 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_294| .cse1)))) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))))) is different from true [2022-11-03 02:00:30,370 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse0 (select |c_#valid| .cse0)))) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_294| .cse1)))) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|)))) is different from false [2022-11-03 02:00:30,374 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse0 (select |c_#valid| .cse0)))) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_294| .cse1)))) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|)))) is different from true [2022-11-03 02:00:30,392 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-03 02:00:30,397 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-03 02:00:30,413 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-11-03 02:00:30,418 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from true [2022-11-03 02:00:30,431 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-11-03 02:00:30,435 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2022-11-03 02:00:30,451 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_295| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_293| .cse1) 0))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-11-03 02:00:30,455 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_295| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_293| .cse1) 0))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from true [2022-11-03 02:00:30,471 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_293| .cse1) 0))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-03 02:00:30,476 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_293| .cse1) 0))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-03 02:00:30,498 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_293| .cse1) 0))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-03 02:00:30,503 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_293| .cse1) 0))) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_#StackHeapBarrier|) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-03 02:00:30,516 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select .cse4 .cse5))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (let ((.cse3 (select .cse4 0))) (and (= (select |v_#valid_BEFORE_CALL_295| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= (select |v_#valid_BEFORE_CALL_295| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_293| .cse3) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| .cse1 1))))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< .cse1 |c_#StackHeapBarrier|) (not (= (select |c_#valid| .cse1) 0)) (not (= .cse6 .cse1)) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2022-11-03 02:00:30,521 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse1)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select .cse4 .cse5))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (let ((.cse3 (select .cse4 0))) (and (= (select |v_#valid_BEFORE_CALL_295| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_293| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= (select |v_#valid_BEFORE_CALL_295| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_293| .cse3) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_295| .cse1 1))))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (< .cse1 |c_#StackHeapBarrier|) (not (= (select |c_#valid| .cse1) 0)) (not (= .cse6 .cse1)) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse1)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2022-11-03 02:00:30,544 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (= (select |c_#length| |c_node_create_~temp~0#1.base|) 12) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2022-11-03 02:00:30,549 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (= (select |c_#length| |c_node_create_~temp~0#1.base|) 12) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2022-11-03 02:00:30,572 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (exists ((v_ArrVal_4724 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4724) |c_#memory_$Pointer$.offset|)) (= (select |c_#length| |c_node_create_~temp~0#1.base|) 12) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_4723 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4723) |c_#memory_$Pointer$.base|)) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|)) is different from false [2022-11-03 02:00:30,577 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (exists ((v_ArrVal_4724 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4724) |c_#memory_$Pointer$.offset|)) (= (select |c_#length| |c_node_create_~temp~0#1.base|) 12) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_4723 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4723) |c_#memory_$Pointer$.base|)) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|)) is different from true [2022-11-03 02:00:30,593 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (select |c_#length| |c_node_create_~temp~0#1.base|) 12) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_4726 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4726) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_4725 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4725) |c_#memory_$Pointer$.base|)) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|)) is different from false [2022-11-03 02:00:30,598 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse1 (select |v_#valid_BEFORE_CALL_295| .cse1)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|))) (= (select |c_#length| |c_node_create_~temp~0#1.base|) 12) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_ArrVal_4726 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_4726) |c_#memory_$Pointer$.offset|)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_4725 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_4725) |c_#memory_$Pointer$.base|)) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$.base|)) is different from true [2022-11-03 02:00:30,626 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse4 (store |c_old(#memory_$Pointer$.offset)| .cse3 (select |c_#memory_$Pointer$.offset| .cse3)))) (let ((.cse5 (@diff .cse4 |c_#memory_$Pointer$.offset|))) (let ((.cse7 (store .cse4 .cse5 (select |c_#memory_$Pointer$.offset| .cse5)))) (let ((.cse1 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse6 (@diff .cse7 |c_#memory_$Pointer$.offset|)) (.cse8 (select |c_#length| |c_node_create_#res#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse1 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse3 1) |c_#StackHeapBarrier|)) (or (= |c_#memory_$Pointer$.offset| .cse4) (<= (+ .cse5 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse6 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| .cse7)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse1 (select |c_#memory_$Pointer$.base| .cse1))) (exists ((v_ArrVal_4728 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4728))) (= |c_#memory_$Pointer$.offset| (store .cse7 .cse6 (select |c_#memory_$Pointer$.offset| .cse6))) (<= (+ |c_node_create_#res#1.offset| 12) .cse8) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= .cse8 12) (exists ((v_ArrVal_4727 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_4727))))))))) is different from false [2022-11-03 02:00:30,635 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse4 (store |c_old(#memory_$Pointer$.offset)| .cse3 (select |c_#memory_$Pointer$.offset| .cse3)))) (let ((.cse5 (@diff .cse4 |c_#memory_$Pointer$.offset|))) (let ((.cse7 (store .cse4 .cse5 (select |c_#memory_$Pointer$.offset| .cse5)))) (let ((.cse1 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse6 (@diff .cse7 |c_#memory_$Pointer$.offset|)) (.cse8 (select |c_#length| |c_node_create_#res#1.base|))) (and (exists ((|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_294| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse0 (select |v_#valid_BEFORE_CALL_294| .cse0)))) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|))) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= .cse1 |c_node_create_#res#1.base|)) (= |c_node_create_#res#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (v_arrayElimCell_1747 Int) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimIndex_37 Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse2 (select |v_#valid_BEFORE_CALL_295| .cse2)))) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (< v_arrayElimIndex_37 |c_#StackHeapBarrier|))) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse3 1) |c_#StackHeapBarrier|)) (or (= |c_#memory_$Pointer$.offset| .cse4) (<= (+ .cse5 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse6 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| .cse7)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse1 (select |c_#memory_$Pointer$.base| .cse1))) (exists ((v_ArrVal_4728 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_4728))) (= |c_#memory_$Pointer$.offset| (store .cse7 .cse6 (select |c_#memory_$Pointer$.offset| .cse6))) (<= (+ |c_node_create_#res#1.offset| 12) .cse8) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= .cse8 12) (exists ((v_ArrVal_4727 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_4727))))))))) is different from true [2022-11-03 02:00:30,723 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse6 (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (.cse0 (+ 2 .cse2)) (.cse7 (+ 2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse1)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_300| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse3) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse4 (select |v_#valid_BEFORE_CALL_300| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_300| .cse2 1) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse5)) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse6 12) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (<= (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 12) .cse6) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse5)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_37))) (and (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_294| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse9 (select |v_#valid_BEFORE_CALL_294| .cse9)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse10 (select |v_#valid_BEFORE_CALL_295| .cse10)))) (<= .cse8 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse7 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|))))))) is different from false [2022-11-03 02:00:30,729 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse6 (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (.cse0 (+ 2 .cse2)) (.cse7 (+ 2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse1)) (not (= .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_300| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse3) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse4 (select |v_#valid_BEFORE_CALL_300| .cse4)))) (= (select (store |v_#valid_BEFORE_CALL_300| .cse2 1) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse5)) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse6 12) (<= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (<= (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 12) .cse6) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse5)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (let ((.cse8 (+ 2 v_arrayElimIndex_37))) (and (<= .cse8 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (<= .cse7 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_294| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse9 (select |v_#valid_BEFORE_CALL_294| .cse9)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse10 (select |v_#valid_BEFORE_CALL_295| .cse10)))) (<= .cse8 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse7 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|))))))) is different from true [2022-11-03 02:00:30,841 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (.cse7 (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimIndex_37))) (and (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse3 (select |v_#valid_BEFORE_CALL_294| .cse3)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse5 (select |v_#valid_BEFORE_CALL_295| .cse5)))) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse6)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 12 .cse7) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse8 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse9) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse10 (select |v_#valid_BEFORE_CALL_300| .cse10))))))) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) .cse7)))) is different from false [2022-11-03 02:00:30,847 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (.cse7 (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse1)) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimIndex_37))) (and (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse3 (select |v_#valid_BEFORE_CALL_294| .cse3)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse5 (select |v_#valid_BEFORE_CALL_295| .cse5)))) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse6)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 12 .cse7) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| .cse6)) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse8 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse9) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse10 (select |v_#valid_BEFORE_CALL_300| .cse10))))))) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse1)) (not (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) .cse7)))) is different from true [2022-11-03 02:00:30,929 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 12 .cse6) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (not (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse8) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse5) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse8 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse9) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse10 (select |v_#valid_BEFORE_CALL_300| .cse10))))))) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) .cse6)))) is different from false [2022-11-03 02:00:30,935 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 12 .cse6) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (not (= .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse8) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse5) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse8 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse9) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse10 (select |v_#valid_BEFORE_CALL_300| .cse10))))))) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) .cse6)))) is different from true [2022-11-03 02:00:30,996 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse5 0) (not (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 12 .cse7) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse8) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse5) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse8) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse5) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse8 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse9) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse10 (select |v_#valid_BEFORE_CALL_300| .cse10))))))) (not (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) .cse7)))) is different from false [2022-11-03 02:00:31,002 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse5 0) (not (= .cse6 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= 12 .cse7) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse8) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse5) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse8) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse5) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| .cse8) 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse8 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse9) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse10 (select |v_#valid_BEFORE_CALL_300| .cse10))))))) (not (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) .cse7)))) is different from true [2022-11-03 02:00:31,073 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.base| .cse8)) (.cse7 (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 .cse2) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse3 (+ 2 v_arrayElimIndex_37))) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse4 (select |v_#valid_BEFORE_CALL_294| .cse4)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse6 (select |v_#valid_BEFORE_CALL_295| .cse6)))) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= 12 .cse7) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse2) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse8) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse9 (select .cse1 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse8 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse9) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse10 (select |v_#valid_BEFORE_CALL_300| .cse10))))))) (not (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) .cse7)))) is different from false [2022-11-03 02:00:31,080 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse8)) (.cse5 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.base| .cse8)) (.cse7 (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 .cse2) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse3 (+ 2 v_arrayElimIndex_37))) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse4 (select |v_#valid_BEFORE_CALL_294| .cse4)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse6 (select |v_#valid_BEFORE_CALL_295| .cse6)))) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= 12 .cse7) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (<= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse2) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse8) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (let ((.cse9 (select .cse1 0))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse8 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse8) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse9) 1) (= (select |v_#valid_BEFORE_CALL_299| .cse9) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse10 (select |v_#valid_BEFORE_CALL_300| .cse10))))))) (not (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) .cse7)))) is different from true [2022-11-03 02:00:31,156 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse6)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) 12) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse6) 0)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse6 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_300| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_300| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse7 (select |v_#valid_BEFORE_CALL_300| .cse7)))) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse5) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse6) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse6) 0)) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from false [2022-11-03 02:00:31,163 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse6)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimIndex_37))) (and (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse2 (select |v_#valid_BEFORE_CALL_294| .cse2)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= .cse5 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (= (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)) 12) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse6) 0)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse6 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_300| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_300| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse7 (select |v_#valid_BEFORE_CALL_300| .cse7)))) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse5) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse6) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse6) 0)) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from true [2022-11-03 02:00:31,208 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse9)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse1 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse9)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse9)) (.cse8 (select |c_#memory_$Pointer$.base| .cse9)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not .cse1) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimIndex_37))) (and (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse3 (select |v_#valid_BEFORE_CALL_294| .cse3)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse5 (select |v_#valid_BEFORE_CALL_295| .cse5)))) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select .cse6 .cse7) 0) (= .cse7 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select .cse8 0)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse9 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_300| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_300| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse10 (select |v_#valid_BEFORE_CALL_300| .cse10)))) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse9)) (or .cse1 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select .cse6 0))) (= (select |c_#length| (select .cse8 .cse7)) 12) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from false [2022-11-03 02:00:31,215 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse9)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse1 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| .cse9)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse9)) (.cse8 (select |c_#memory_$Pointer$.base| .cse9)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not .cse1) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|v_#valid_BEFORE_CALL_296| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimIndex_37))) (and (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse3 (select |v_#valid_BEFORE_CALL_294| .cse3)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_295| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse5 (select |v_#valid_BEFORE_CALL_295| .cse5)))) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select .cse6 .cse7) 0) (= .cse7 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (select .cse8 0)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse9 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_300| .cse9) 0) (= (select |v_#valid_BEFORE_CALL_300| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_300| (let ((.cse10 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse10 (select |v_#valid_BEFORE_CALL_300| .cse10)))) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0))) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse9)) (or .cse1 (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select .cse6 0))) (= (select |c_#length| (select .cse8 .cse7)) 12) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 12) (select |c_#length| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))))) is different from true [2022-11-03 02:00:31,270 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse4 (select .cse11 0))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse9 (+ 2 .cse4)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse2 (select |c_#length| .cse4))) (or (let ((.cse1 (select .cse3 0))) (and (<= 0 .cse1) (<= (+ .cse1 12) .cse2))) (and (= .cse4 .cse5) (<= 12 .cse2)))) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_37))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse7 (select |v_#valid_BEFORE_CALL_294| .cse7)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse8 (select |v_#valid_BEFORE_CALL_295| .cse8)))) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse6 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse9 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select .cse3 .cse10) 0) (= .cse10 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse5)) (= (select |c_#length| (select .cse11 .cse10)) 12) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_300| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_300| .cse5 1) .cse4) 0) (= (select |v_#valid_BEFORE_CALL_300| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_300| (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse12 (select |v_#valid_BEFORE_CALL_300| .cse12)))) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0)))))))) is different from false [2022-11-03 02:00:31,277 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse4 (select .cse11 0))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse9 (+ 2 .cse4)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse2 (select |c_#length| .cse4))) (or (let ((.cse1 (select .cse3 0))) (and (<= 0 .cse1) (<= (+ .cse1 12) .cse2))) (and (= .cse4 .cse5) (<= 12 .cse2)))) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_37))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse7 (select |v_#valid_BEFORE_CALL_294| .cse7)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse8 (select |v_#valid_BEFORE_CALL_295| .cse8)))) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse6 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse9 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select .cse3 .cse10) 0) (= .cse10 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse5)) (= (select |c_#length| (select .cse11 .cse10)) 12) (not (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_300| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_300| .cse5 1) .cse4) 0) (= (select |v_#valid_BEFORE_CALL_300| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= |v_#valid_BEFORE_CALL_300| (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse12 (select |v_#valid_BEFORE_CALL_300| .cse12)))) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0)))))))) is different from true [2022-11-03 02:00:31,346 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse4 (select .cse11 0))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse9 (+ 2 .cse4)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse2 (select |c_#length| .cse4))) (or (let ((.cse1 (select .cse3 0))) (and (<= 0 .cse1) (<= (+ .cse1 12) .cse2))) (and (= .cse4 .cse5) (<= 12 .cse2)))) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_37))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse7 (select |v_#valid_BEFORE_CALL_294| .cse7)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse8 (select |v_#valid_BEFORE_CALL_295| .cse8)))) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse6 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse9 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select .cse3 .cse10) 0) (= .cse10 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#length| (select .cse11 .cse10)) 12) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_300| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_300| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_300| .cse5 1) .cse4) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse12 (select |v_#valid_BEFORE_CALL_300| .cse12))))))))))) is different from false [2022-11-03 02:00:31,353 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse4 (select .cse11 0))) (let ((.cse0 (+ 2 .cse5)) (.cse3 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse9 (+ 2 .cse4)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (let ((.cse2 (select |c_#length| .cse4))) (or (let ((.cse1 (select .cse3 0))) (and (<= 0 .cse1) (<= (+ .cse1 12) .cse2))) (and (= .cse4 .cse5) (<= 12 .cse2)))) (exists ((|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (v_arrayElimCell_1747 Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int)) (let ((.cse6 (+ 2 v_arrayElimIndex_37))) (and (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse7 (select |v_#valid_BEFORE_CALL_294| .cse7)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse8 (select |v_#valid_BEFORE_CALL_295| .cse8)))) (<= .cse9 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (<= .cse6 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse9 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|)))) (= (select .cse3 .cse10) 0) (= .cse10 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#length| (select .cse11 .cse10)) 12) (exists ((|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_300| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_299| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_300| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_300| .cse5 1) .cse4) 0) (= |v_#valid_BEFORE_CALL_300| (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse12 (select |v_#valid_BEFORE_CALL_300| .cse12))))))))))) is different from true [2022-11-03 02:00:31,433 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (v_arrayElimCell_1747 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse0) 0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 v_arrayElimIndex_37)) (.cse1 (+ 2 .cse6)) (.cse3 (+ .cse0 2))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_300| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_300| .cse0) 0) (<= 0 .cse4) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (<= (+ 12 .cse4) (select |c_#length| .cse6)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_294| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse7 (select |v_#valid_BEFORE_CALL_294| .cse7)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse8 (select |v_#valid_BEFORE_CALL_295| .cse8)))) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= .cse5 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse0 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_300| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse9 (select |v_#valid_BEFORE_CALL_300| .cse9)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)))))) (= (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 12)) is different from false [2022-11-03 02:00:31,439 WARN L855 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|) 0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (v_arrayElimCell_1747 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| .cse0) 0)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (.cse2 (+ 2 v_arrayElimIndex_37)) (.cse1 (+ 2 .cse6)) (.cse3 (+ .cse0 2))) (and (= .cse0 |c_ULTIMATE.start_main_~ptr~0#1.base|) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_300| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_300| .cse0) 0) (<= 0 .cse4) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse5) (<= (+ 12 .cse4) (select |c_#length| .cse6)) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_294| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse7 (select |v_#valid_BEFORE_CALL_294| .cse7)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse8 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse8 (select |v_#valid_BEFORE_CALL_295| .cse8)))) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (= .cse5 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| .cse0 1) .cse6) 0) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_300| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse9 (select |v_#valid_BEFORE_CALL_300| .cse9)))) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse3 |ULTIMATE.start_main_~#s~0#1.base|)))))) (= (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) 12)) is different from true [2022-11-03 02:00:31,495 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse0 12) (<= (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 12) .cse0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (v_arrayElimCell_1747 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_37)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse1 (+ 2 v_arrayElimIndex_45))) (and (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_300| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| v_arrayElimIndex_45 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse3 (select |v_#valid_BEFORE_CALL_294| .cse3)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse5 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_300| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse6 (select |v_#valid_BEFORE_CALL_300| .cse6)))) (= (select |v_#valid_BEFORE_CALL_300| v_arrayElimIndex_45) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|)))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from false [2022-11-03 02:00:31,501 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= .cse0 12) (<= (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 12) .cse0) (exists ((|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39| Int) (|v_#valid_BEFORE_CALL_299| (Array Int Int)) (|v_#valid_BEFORE_CALL_300| (Array Int Int)) (|v_#valid_BEFORE_CALL_295| (Array Int Int)) (|v_#valid_BEFORE_CALL_296| (Array Int Int)) (|v_#valid_BEFORE_CALL_293| (Array Int Int)) (|v_#valid_BEFORE_CALL_294| (Array Int Int)) (v_arrayElimCell_1747 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_37 Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104| Int) (v_arrayElimIndex_45 Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162| Int) (|ULTIMATE.start_dll_circular_insert_~last~1#1.base| Int)) (let ((.cse2 (+ 2 v_arrayElimIndex_37)) (.cse5 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2)) (.cse1 (+ 2 v_arrayElimIndex_45))) (and (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= (select |v_#valid_BEFORE_CALL_300| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_300| v_arrayElimIndex_45 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_dll_circular_insert_~last~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimIndex_37) 0) (= |v_#valid_BEFORE_CALL_294| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_296| |v_#valid_BEFORE_CALL_294|))) (store |v_#valid_BEFORE_CALL_296| .cse3 (select |v_#valid_BEFORE_CALL_294| .cse3)))) (= (select |v_#valid_BEFORE_CALL_293| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) 1) (= (select |v_#valid_BEFORE_CALL_293| v_arrayElimCell_1747) 0) (= |v_#valid_BEFORE_CALL_295| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_293| |v_#valid_BEFORE_CALL_295|))) (store |v_#valid_BEFORE_CALL_293| .cse4 (select |v_#valid_BEFORE_CALL_295| .cse4)))) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 0) (= (select |v_#valid_BEFORE_CALL_296| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) 1) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_#valid_BEFORE_CALL_294| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_104|) 1) (= (select |v_#valid_BEFORE_CALL_295| v_arrayElimCell_1747) 1) (= (select |v_#valid_BEFORE_CALL_299| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse5 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_39|) (<= .cse5 |ULTIMATE.start_main_~#s~0#1.base|) (<= .cse5 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|) (= |v_#valid_BEFORE_CALL_300| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_299| |v_#valid_BEFORE_CALL_300|))) (store |v_#valid_BEFORE_CALL_299| .cse6 (select |v_#valid_BEFORE_CALL_300| .cse6)))) (= (select |v_#valid_BEFORE_CALL_300| v_arrayElimIndex_45) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_162|)))) (<= 0 |c_ULTIMATE.start_main_~ptr~0#1.offset|))) is different from true [2022-11-03 02:00:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:00:31,895 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-11-03 02:00:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-03 02:00:31,896 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 52 states have internal predecessors, (86), 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 50 [2022-11-03 02:00:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:00:31,897 INFO L225 Difference]: With dead ends: 85 [2022-11-03 02:00:31,897 INFO L226 Difference]: Without dead ends: 85 [2022-11-03 02:00:31,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 132 ConstructedPredicates, 55 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 30.6s TimeCoverageRelationStatistics Valid=407, Invalid=5856, Unknown=119, NotChecked=11440, Total=17822 [2022-11-03 02:00:31,899 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1162 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:00:31,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 524 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 499 Invalid, 0 Unknown, 1162 Unchecked, 0.6s Time] [2022-11-03 02:00:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-03 02:00:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-03 02:00:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:00:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-11-03 02:00:31,903 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 50 [2022-11-03 02:00:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:00:31,903 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-11-03 02:00:31,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 52 states have internal predecessors, (86), 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-03 02:00:31,903 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-11-03 02:00:31,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-03 02:00:31,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:00:31,904 INFO L195 NwaCegarLoop]: trace histogram [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-03 02:00:31,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 02:00:32,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-03 02:00:32,105 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 02:00:32,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:00:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash -165635419, now seen corresponding path program 1 times [2022-11-03 02:00:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:00:32,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121700787] [2022-11-03 02:00:32,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:00:32,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:00:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:00:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:00:37,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:00:37,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121700787] [2022-11-03 02:00:37,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121700787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:00:37,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532379730] [2022-11-03 02:00:37,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:00:37,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:00:37,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:00:37,535 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:00:37,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 02:00:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:00:37,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-03 02:00:37,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:00:37,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:00:38,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:00:38,339 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:00:38,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:00:38,574 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-03 02:00:38,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:38,811 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:00:38,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-11-03 02:00:39,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:39,297 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 14 treesize of output 16 [2022-11-03 02:00:39,683 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:00:39,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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-03 02:00:39,881 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 61 treesize of output 40 [2022-11-03 02:00:40,076 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:40,076 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 58 treesize of output 25 [2022-11-03 02:00:40,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:40,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:00:40,091 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-03 02:00:40,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:40,722 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:00:40,722 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 66 treesize of output 56 [2022-11-03 02:00:40,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:40,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:40,756 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-03 02:00:40,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-03 02:00:40,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:40,780 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-03 02:00:41,886 INFO L356 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-03 02:00:41,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 62 [2022-11-03 02:00:41,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:41,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-03 02:00:42,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:42,083 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-03 02:00:42,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:42,105 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:00:42,105 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 43 treesize of output 45 [2022-11-03 02:00:42,160 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-03 02:00:42,160 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 68 [2022-11-03 02:00:42,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:42,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-03 02:00:42,375 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:00:42,375 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 65 treesize of output 55 [2022-11-03 02:00:42,394 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-03 02:00:42,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:00:42,917 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:42,917 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 57 treesize of output 24 [2022-11-03 02:00:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:00:42,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:00:42,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4991 (Array Int Int)) (v_ArrVal_4992 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4992))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4991) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-03 02:00:42,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4990 (Array Int Int)) (v_ArrVal_4991 (Array Int Int)) (v_ArrVal_4992 (Array Int Int)) (v_ArrVal_4989 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4990) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4992))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4989) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4991) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-03 02:00:44,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5002 (Array Int Int)) (v_ArrVal_4990 (Array Int Int)) (v_ArrVal_5001 (Array Int Int)) (v_ArrVal_4991 (Array Int Int)) (v_ArrVal_4992 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_51| Int) (v_ArrVal_4985 (Array Int Int)) (v_ArrVal_4989 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_51| v_ArrVal_5002))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_51|) 0)) (not (<= 0 .cse0)) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_51| |c_#StackHeapBarrier|)) (not (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_51| v_ArrVal_5001))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse7 (select .cse6 .cse4))) (let ((.cse5 (select .cse7 .cse0))) (let ((.cse1 (store (store (store .cse6 .cse4 (store .cse7 .cse0 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_51|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_51| v_ArrVal_4990) .cse5 v_ArrVal_4992))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse1 .cse2) (select (select (store (store (store .cse3 .cse4 v_ArrVal_4985) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_51| v_ArrVal_4989) .cse5 v_ArrVal_4991) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2)))))))))))) is different from false [2022-11-03 02:00:44,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532379730] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:00:44,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [203407024] [2022-11-03 02:00:44,699 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-03 02:00:44,699 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:00:44,700 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:00:44,700 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:00:44,700 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:00:44,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:00:44,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:00:44,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:00:44,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:00:44,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:00:44,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:44,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:44,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:00:44,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:44,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:44,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:00:44,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:00:44,836 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 13 treesize of output 9 [2022-11-03 02:00:44,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:00:44,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:00:44,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:44,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:00:45,055 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 02:00:45,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 02:00:45,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:00:45,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:45,277 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:00:45,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 02:00:45,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:00:45,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:45,317 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-03 02:00:45,330 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:45,333 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:45,336 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:45,405 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 02:00:45,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 02:00:45,633 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:00:45,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:00:45,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:00:45,668 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:00:45,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:00:45,716 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:45,718 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:45,721 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:45,776 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 23 treesize of output 11 [2022-11-03 02:00:45,789 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:00:45,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:00:45,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:45,834 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 27 treesize of output 11 [2022-11-03 02:00:45,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:45,865 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:00:45,865 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:00:45,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:45,896 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:00:45,896 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:00:45,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:45,953 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:00:45,954 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:00:45,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:45,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:46,002 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:00:46,003 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:00:46,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:00:46,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:46,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:46,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:00:46,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:46,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:00:46,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:46,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:46,213 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:46,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:00:46,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:00:46,233 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 19 [2022-11-03 02:00:46,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:46,262 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:46,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:00:46,281 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:46,281 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 7 [2022-11-03 02:00:46,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:46,351 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:46,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:00:46,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:00:46,378 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:46,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:00:46,400 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:00:46,400 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 7 [2022-11-03 02:00:46,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:00:46,421 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 19 [2022-11-03 02:00:46,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:46,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:00:46,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:46,753 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:00:46,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 02:00:46,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:00:46,797 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:00:46,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:46,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,860 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:00:46,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 02:00:46,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:00:46,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:46,929 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:00:46,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 02:00:46,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:00:46,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:47,052 INFO L356 Elim1Store]: treesize reduction 100, result has 24.2 percent of original size [2022-11-03 02:00:47,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 58 [2022-11-03 02:00:47,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:47,219 INFO L356 Elim1Store]: treesize reduction 54, result has 59.1 percent of original size [2022-11-03 02:00:47,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 113 [2022-11-03 02:00:47,290 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-11-03 02:00:47,361 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-11-03 02:00:50,108 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-11-03 02:00:50,333 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 02:00:50,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 02:00:50,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:00:50,497 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:00:50,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:00:50,519 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:00:50,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:00:50,542 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:50,544 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:50,546 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:50,611 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 02:00:50,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 02:00:50,727 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:00:50,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:00:50,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:00:50,757 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:00:50,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:00:50,788 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:50,790 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:50,793 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 02:00:50,874 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 23 treesize of output 11 [2022-11-03 02:00:50,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:00:50,896 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:00:50,966 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 02:00:50,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 229 [2022-11-03 02:00:51,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:51,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:51,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:00:51,063 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 02:00:51,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:00:51,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:00:51,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:00:51,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:51,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:00:51,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:51,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:51,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:51,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:00:51,123 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 19 treesize of output 1 [2022-11-03 02:00:51,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:51,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:51,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:00:51,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:51,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:00:51,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:00:51,155 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 13 treesize of output 9 [2022-11-03 02:00:51,157 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:01:07,403 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13341#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (<= |ULTIMATE.start_main_~count~0#1| 1) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|))' at error location [2022-11-03 02:01:07,404 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:01:07,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:01:07,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31] total 63 [2022-11-03 02:01:07,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779483459] [2022-11-03 02:01:07,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:07,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-03 02:01:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:07,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-03 02:01:07,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=9160, Unknown=9, NotChecked=582, Total=10100 [2022-11-03 02:01:07,407 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 64 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 53 states have internal predecessors, (87), 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-03 02:01:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:13,002 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-11-03 02:01:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 02:01:13,003 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 53 states have internal predecessors, (87), 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-03 02:01:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:13,004 INFO L225 Difference]: With dead ends: 90 [2022-11-03 02:01:13,004 INFO L226 Difference]: Without dead ends: 90 [2022-11-03 02:01:13,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3881 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=569, Invalid=13006, Unknown=9, NotChecked=696, Total=14280 [2022-11-03 02:01:13,005 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 320 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:13,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 832 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1703 Invalid, 0 Unknown, 99 Unchecked, 2.0s Time] [2022-11-03 02:01:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-03 02:01:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-11-03 02:01:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.28125) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:01:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-11-03 02:01:13,009 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 51 [2022-11-03 02:01:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:13,010 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-11-03 02:01:13,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 53 states have internal predecessors, (87), 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-03 02:01:13,010 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-11-03 02:01:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-03 02:01:13,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:13,011 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:13,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:13,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:13,237 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 02:01:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:13,238 INFO L85 PathProgramCache]: Analyzing trace with hash -839697997, now seen corresponding path program 1 times [2022-11-03 02:01:13,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:13,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636339296] [2022-11-03 02:01:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:13,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:01:18,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:18,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636339296] [2022-11-03 02:01:18,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636339296] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:18,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286351808] [2022-11-03 02:01:18,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:18,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:18,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:18,229 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:18,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 02:01:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:18,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 159 conjunts are in the unsatisfiable core [2022-11-03 02:01:18,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:18,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:01:18,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:01:18,956 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:01:18,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:01:19,201 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-03 02:01:19,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:19,418 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:01:19,418 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 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-03 02:01:19,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:19,890 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:01:19,890 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 34 treesize of output 33 [2022-11-03 02:01:20,191 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:01:20,191 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 36 treesize of output 35 [2022-11-03 02:01:20,343 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 61 treesize of output 40 [2022-11-03 02:01:20,507 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:01:20,508 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 58 treesize of output 25 [2022-11-03 02:01:20,515 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-03 02:01:20,519 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-03 02:01:20,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:01:20,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:20,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:01:20,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:20,914 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:01:20,915 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 66 treesize of output 56 [2022-11-03 02:01:20,947 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-03 02:01:20,947 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-03 02:01:22,149 INFO L356 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-03 02:01:22,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 77 [2022-11-03 02:01:22,169 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-03 02:01:22,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:22,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-11-03 02:01:22,372 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 23 treesize of output 22 [2022-11-03 02:01:22,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:22,401 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:01:22,401 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 58 treesize of output 58 [2022-11-03 02:01:22,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:22,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:22,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-11-03 02:01:22,526 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-03 02:01:22,527 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 127 [2022-11-03 02:01:22,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:22,546 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 69 treesize of output 60 [2022-11-03 02:01:22,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:22,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:22,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2022-11-03 02:01:22,773 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:01:22,773 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 109 treesize of output 89 [2022-11-03 02:01:22,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-03 02:01:22,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:22,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2022-11-03 02:01:23,306 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-03 02:01:23,306 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 63 [2022-11-03 02:01:23,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:23,508 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 47 treesize of output 22 [2022-11-03 02:01:23,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:01:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:23,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:24,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5254 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5252)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5253))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5254) (select (select .cse0 .cse1) .cse2)) (+ 8 (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-11-03 02:01:24,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5250 Int) (v_ArrVal_5254 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5249) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5252)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5248) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5253))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_5250)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5254) (select (select .cse0 .cse1) .cse2)) (+ 8 (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-11-03 02:01:24,030 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5250 Int) (v_ArrVal_5254 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int)) (v_ArrVal_5244 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5249) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5252)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5248) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5253))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_ArrVal_5244) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_5250)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5254) (select (select .cse0 .cse1) .cse2)) (+ 8 (select (select .cse3 .cse1) .cse2))))))) is different from false [2022-11-03 02:01:25,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:01:25,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 476 treesize of output 469 [2022-11-03 02:01:25,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:01:25,923 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 14972 treesize of output 14572 [2022-11-03 02:01:25,964 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 14360 treesize of output 11936 [2022-11-03 02:01:26,022 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 24284 treesize of output 22062 [2022-11-03 02:01:26,132 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:01:26,133 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 9859 treesize of output 9255 [2022-11-03 02:01:27,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:01:27,243 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 25867 treesize of output 24859 [2022-11-03 02:01:33,253 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse11 (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5265 (Array Int Int))) (let ((.cse103 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265))) (let ((.cse94 (select (select .cse103 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (<= 0 .cse94)) (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (let ((.cse99 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266))) (let ((.cse100 (select (select .cse99 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse101 (select .cse99 .cse100))) (let ((.cse102 (select .cse101 .cse94))) (let ((.cse98 (store (store (store .cse103 .cse100 (store (select .cse103 .cse100) .cse94 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5249) .cse102 v_ArrVal_5252)) (.cse95 (store (store (store .cse99 .cse100 (store .cse101 .cse94 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5248) .cse102 v_ArrVal_5253))) (let ((.cse96 (select (select .cse95 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse97 (select (select .cse98 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse95 .cse96) .cse97) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) (not (= (+ (select (select .cse98 .cse96) .cse97) 4) 0)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0))))) (.cse12 (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5265 (Array Int Int))) (let ((.cse93 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265))) (let ((.cse84 (select (select .cse93 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (<= 0 .cse84)) (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (let ((.cse89 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266))) (let ((.cse90 (select (select .cse89 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse91 (select .cse89 .cse90))) (let ((.cse92 (select .cse91 .cse84))) (let ((.cse88 (store (store (store .cse93 .cse90 (store (select .cse93 .cse90) .cse84 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5249) .cse92 v_ArrVal_5252)) (.cse85 (store (store (store .cse89 .cse90 (store .cse91 .cse84 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5248) .cse92 v_ArrVal_5253))) (let ((.cse86 (select (select .cse85 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse87 (select (select .cse88 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse85 .cse86) .cse87) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) (not (= (+ (select (select .cse88 .cse86) .cse87) 8) 0)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0))))) (.cse20 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|))) (and (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5265 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse9 (select .cse7 .cse8))) (let ((.cse2 (select .cse9 .cse0))) (let ((.cse3 (store (store (store .cse10 .cse8 (store (select .cse10 .cse8) .cse0 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5249) .cse2 v_ArrVal_5252)) (.cse6 (store (store (store .cse7 .cse8 (store .cse9 .cse0 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5248) .cse2 v_ArrVal_5253))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse6 .cse4) .cse5))) (or (not (= .cse1 .cse2)) (not (= .cse1 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) (= (select (select .cse3 .cse4) .cse5) 0)))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0)))) (or (and .cse11 .cse12 (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0)) (forall ((v_ArrVal_5265 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265))) (let ((.cse13 (select (select .cse19 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (<= 0 .cse13)) (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (not (= (let ((.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse17 (select .cse15 .cse16))) (let ((.cse18 (select .cse17 .cse13))) (select (let ((.cse14 (store (store (store .cse15 .cse16 (store .cse17 .cse13 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5248) .cse18 v_ArrVal_5253))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse19 .cse16 (store (select .cse19 .cse16) .cse13 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5249) .cse18 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|))))))))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5265 (Array Int Int))) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)))) (forall ((v_ArrVal_5266 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0))))) .cse20) .cse11 .cse12 (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0)) (forall ((v_ArrVal_5265 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (= (let ((.cse22 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse24 (select .cse22 .cse23))) (let ((.cse26 (select .cse24 .cse25))) (select (let ((.cse21 (store (store (store .cse22 .cse23 (store .cse24 .cse25 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5248) .cse26 v_ArrVal_5253))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse27 .cse23 (store (select .cse27 .cse23) .cse25 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5249) .cse26 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) (not (<= 0 .cse25)))))))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0)) (forall ((v_ArrVal_5265 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265))) (let ((.cse36 (select (select .cse37 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266))) (let ((.cse28 (select (select .cse34 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse35 (select .cse34 .cse28))) (let ((.cse32 (select .cse35 .cse36))) (let ((.cse33 (store (store (store .cse37 .cse28 (store (select .cse37 .cse28) .cse36 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5249) .cse32 v_ArrVal_5252)) (.cse29 (store (store (store .cse34 .cse28 (store .cse35 .cse36 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5248) .cse32 v_ArrVal_5253))) (let ((.cse30 (select (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse31 (select (select .cse33 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) (not (= (select (select .cse29 .cse30) .cse31) .cse32)) (= (select (select .cse33 .cse30) .cse31) 0))))))))) (not (<= 0 .cse36)))))))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5265 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265))) (let ((.cse38 (select (select .cse44 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (<= 0 .cse38)) (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266))) (let ((.cse39 (select (select .cse41 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= .cse39 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) (= (let ((.cse42 (select .cse41 .cse39))) (let ((.cse43 (select .cse42 .cse38))) (let ((.cse40 (store (store (store .cse44 .cse39 (store (select .cse44 .cse39) .cse38 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5249) .cse43 v_ArrVal_5252))) (select (select .cse40 (select (select (store (store (store .cse41 .cse39 (store .cse42 .cse38 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5248) .cse43 v_ArrVal_5253) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse40 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 0))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int)) (or (forall ((v_ArrVal_5265 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265))) (let ((.cse45 (select (select .cse51 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (<= 0 .cse45)) (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266))) (let ((.cse46 (select (select .cse48 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= .cse46 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) (not (= (let ((.cse49 (select .cse48 .cse46))) (let ((.cse50 (select .cse49 .cse45))) (select (let ((.cse47 (store (store (store .cse48 .cse46 (store .cse49 .cse45 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5248) .cse50 v_ArrVal_5253))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse51 .cse46 (store (select .cse51 .cse46) .cse45 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5249) .cse50 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)))))))))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5265 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265))) (let ((.cse58 (select (select .cse59 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266))) (let ((.cse56 (select (select .cse55 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse57 (select .cse55 .cse56))) (let ((.cse53 (select .cse57 .cse58))) (let ((.cse52 (select (let ((.cse54 (store (store (store .cse55 .cse56 (store .cse57 .cse58 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5248) .cse53 v_ArrVal_5253))) (select .cse54 (select (select .cse54 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse59 .cse56 (store (select .cse59 .cse56) .cse58 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5249) .cse53 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (not (= .cse52 .cse53)) (not (= .cse52 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|))))))))) (not (<= 0 .cse58)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5265 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265))) (let ((.cse60 (select (select .cse69 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (<= 0 .cse60)) (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (let ((.cse65 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266))) (let ((.cse66 (select (select .cse65 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse67 (select .cse65 .cse66))) (let ((.cse68 (select .cse67 .cse60))) (let ((.cse64 (store (store (store .cse69 .cse66 (store (select .cse69 .cse66) .cse60 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5249) .cse68 v_ArrVal_5252)) (.cse61 (store (store (store .cse65 .cse66 (store .cse67 .cse60 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5248) .cse68 v_ArrVal_5253))) (let ((.cse62 (select (select .cse61 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse63 (select (select .cse64 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse61 .cse62) .cse63) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) (= (select (select .cse64 .cse62) .cse63) 0))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0)))) (or (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5265 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (let ((.cse76 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265))) (let ((.cse70 (select (select .cse76 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (not (<= 0 .cse70)) (not (= (let ((.cse72 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266))) (let ((.cse73 (select (select .cse72 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse74 (select .cse72 .cse73))) (let ((.cse75 (select .cse74 .cse70))) (select (let ((.cse71 (store (store (store .cse72 .cse73 (store .cse74 .cse70 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5248) .cse75 v_ArrVal_5253))) (select .cse71 (select (select .cse71 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse76 .cse73 (store (select .cse76 .cse73) .cse70 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5249) .cse75 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0)))))) .cse20) (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| Int)) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5265 (Array Int Int))) (let ((.cse83 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5265))) (let ((.cse81 (select (select .cse83 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (forall ((v_ArrVal_5253 (Array Int Int)) (v_ArrVal_5252 (Array Int Int)) (v_ArrVal_5266 (Array Int Int)) (v_ArrVal_5248 (Array Int Int)) (v_ArrVal_5249 (Array Int Int))) (let ((.cse79 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5266))) (let ((.cse77 (select (select .cse79 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= .cse77 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) (not (let ((.cse80 (select .cse79 .cse77))) (let ((.cse82 (select .cse80 .cse81))) (= (select (let ((.cse78 (store (store (store .cse79 .cse77 (store .cse80 .cse81 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5248) .cse82 v_ArrVal_5253))) (select .cse78 (select (select .cse78 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse83 .cse77 (store (select .cse83 .cse77) .cse81 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55| v_ArrVal_5249) .cse82 v_ArrVal_5252) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse82)))))))) (not (<= 0 .cse81)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_55|) 0)))))) is different from true [2022-11-03 02:01:33,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286351808] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:33,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1737815523] [2022-11-03 02:01:33,260 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-03 02:01:33,260 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:01:33,260 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:01:33,260 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:01:33,260 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:01:33,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:01:33,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:01:33,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:01:33,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:01:33,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:33,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-03 02:01:33,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:01:33,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:01:33,387 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 19 treesize of output 1 [2022-11-03 02:01:33,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:01:33,407 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 13 treesize of output 9 [2022-11-03 02:01:33,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:01:33,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:01:33,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:01:33,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:01:33,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:01:33,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,603 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:01:33,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:01:33,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:01:33,652 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:01:33,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:01:33,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:01:33,692 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:01:33,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,729 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:01:33,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:01:33,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:01:33,778 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:01:33,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:01:33,802 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:01:33,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:01:33,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:01:33,882 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:01:33,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 02:01:33,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:01:33,957 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:01:33,957 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:01:33,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:33,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:01:33,996 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:01:33,997 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:01:34,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:34,018 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 27 treesize of output 11 [2022-11-03 02:01:34,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:34,079 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 27 treesize of output 11 [2022-11-03 02:01:34,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:01:34,119 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:01:34,120 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:01:34,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:01:34,155 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:01:34,156 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:01:34,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:34,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:34,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:01:34,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:34,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:01:34,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:34,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:01:34,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:01:34,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:34,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:34,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:01:34,542 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:01:34,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:01:34,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:34,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:34,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:01:34,578 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:01:34,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:01:34,602 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:01:34,602 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 7 [2022-11-03 02:01:34,630 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:01:34,630 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 19 [2022-11-03 02:01:34,767 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:01:34,767 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 19 [2022-11-03 02:01:34,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:34,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:34,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:01:34,805 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:01:34,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:01:34,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:34,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:34,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:01:34,845 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:01:34,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:01:34,867 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:01:34,868 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 7 [2022-11-03 02:01:35,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:35,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:01:35,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:35,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:01:35,198 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:01:35,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 02:01:35,245 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:01:35,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:01:35,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:01:35,346 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:01:35,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 02:01:35,435 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:01:35,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 02:01:35,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:01:35,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:01:35,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:01:36,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:36,417 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:01:36,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:01:36,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:01:36,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:01:36,478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:01:36,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:01:36,507 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:01:36,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:36,539 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:01:36,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:01:36,577 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:01:36,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:01:36,606 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:01:36,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:01:36,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:01:36,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:36,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:36,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:01:36,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:36,791 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:01:36,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:01:36,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:36,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:36,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:01:36,835 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 18 for LOIs [2022-11-03 02:01:36,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:01:36,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:01:36,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:36,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:01:36,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:01:36,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:36,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:01:36,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:36,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:01:36,920 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 19 treesize of output 1 [2022-11-03 02:01:36,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:01:36,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:36,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:36,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:01:36,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:36,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:36,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:01:36,968 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:01:53,023 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13872#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)))' at error location [2022-11-03 02:01:53,023 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:01:53,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:01:53,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 59 [2022-11-03 02:01:53,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744390950] [2022-11-03 02:01:53,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:53,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-03 02:01:53,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:53,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-03 02:01:53,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=9124, Unknown=7, NotChecked=780, Total=10302 [2022-11-03 02:01:53,027 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 60 states, 50 states have (on average 1.66) internal successors, (83), 51 states have internal predecessors, (83), 6 states have call successors, (6), 2 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-03 02:01:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:57,636 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2022-11-03 02:01:57,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 02:01:57,636 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 50 states have (on average 1.66) internal successors, (83), 51 states have internal predecessors, (83), 6 states have call successors, (6), 2 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 52 [2022-11-03 02:01:57,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:57,637 INFO L225 Difference]: With dead ends: 88 [2022-11-03 02:01:57,637 INFO L226 Difference]: Without dead ends: 88 [2022-11-03 02:01:57,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 115 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3881 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=539, Invalid=12126, Unknown=7, NotChecked=900, Total=13572 [2022-11-03 02:01:57,638 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 43 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:57,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 838 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1617 Invalid, 0 Unknown, 8 Unchecked, 2.1s Time] [2022-11-03 02:01:57,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-03 02:01:57,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-11-03 02:01:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 79 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:01:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-11-03 02:01:57,642 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 52 [2022-11-03 02:01:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:57,642 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-11-03 02:01:57,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 50 states have (on average 1.66) internal successors, (83), 51 states have internal predecessors, (83), 6 states have call successors, (6), 2 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-03 02:01:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-11-03 02:01:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-03 02:01:57,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:57,644 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 02:01:57,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:57,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-03 02:01:57,863 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 02:01:57,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash -839697998, now seen corresponding path program 1 times [2022-11-03 02:01:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:57,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236190906] [2022-11-03 02:01:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:57,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:02:01,193 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:01,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236190906] [2022-11-03 02:02:01,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236190906] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:02:01,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963434931] [2022-11-03 02:02:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:01,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:02:01,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:02:01,194 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:02:01,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 02:02:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:01,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 133 conjunts are in the unsatisfiable core [2022-11-03 02:02:01,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:02:01,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:02:01,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:02:01,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:02:01,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:02:01,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:01,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:02:01,957 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:02:01,958 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-03 02:02:02,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:02:02,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:02:02,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:02,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:02:03,031 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-03 02:02:03,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:02:03,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:02:03,047 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-03 02:02:03,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:03,736 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 25 treesize of output 25 [2022-11-03 02:02:03,754 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-03 02:02:03,755 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-03 02:02:03,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:03,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:02:03,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:03,783 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 14 treesize of output 16 [2022-11-03 02:02:04,797 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:02:04,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 57 [2022-11-03 02:02:04,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:04,809 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2022-11-03 02:02:04,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:02:05,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:05,010 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 35 treesize of output 33 [2022-11-03 02:02:05,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:05,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:05,022 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:02:05,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:05,048 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 40 treesize of output 31 [2022-11-03 02:02:05,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:05,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:05,063 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:02:05,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:05,345 INFO L356 Elim1Store]: treesize reduction 46, result has 35.2 percent of original size [2022-11-03 02:02:05,346 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 71 treesize of output 66 [2022-11-03 02:02:05,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:05,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:02:05,419 INFO L356 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-03 02:02:05,419 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2022-11-03 02:02:07,341 INFO L356 Elim1Store]: treesize reduction 32, result has 80.8 percent of original size [2022-11-03 02:02:07,342 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 8 new quantified variables, introduced 15 case distinctions, treesize of input 199 treesize of output 269 [2022-11-03 02:02:07,966 INFO L356 Elim1Store]: treesize reduction 78, result has 73.2 percent of original size [2022-11-03 02:02:07,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 133 treesize of output 303 [2022-11-03 02:04:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:04:17,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:04:18,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:18,446 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 337 treesize of output 301 [2022-11-03 02:04:18,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:18,460 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 247 [2022-11-03 02:04:21,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963434931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:21,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [342713443] [2022-11-03 02:04:21,533 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-03 02:04:21,533 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:04:21,534 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:04:21,534 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:04:21,534 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:04:21,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:04:21,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:04:21,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:04:21,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:04:21,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:21,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:04:21,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:21,632 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 19 treesize of output 1 [2022-11-03 02:04:21,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:21,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:21,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:04:21,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:04:21,686 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 13 treesize of output 9 [2022-11-03 02:04:21,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:04:21,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:04:21,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:04:21,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,824 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:04:21,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:04:21,857 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:04:21,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:21,881 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:04:21,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:21,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:04:21,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:21,955 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:04:21,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:04:21,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:04:22,005 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:04:22,017 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:04:22,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:22,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:22,096 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:04:22,110 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 23 treesize of output 11 [2022-11-03 02:04:22,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:04:22,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:22,182 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:04:22,183 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:04:22,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:22,218 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:04:22,218 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:04:22,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,241 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 27 treesize of output 11 [2022-11-03 02:04:22,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:22,303 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:04:22,304 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:04:22,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,320 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 27 treesize of output 11 [2022-11-03 02:04:22,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:22,352 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:04:22,353 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:04:22,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:04:22,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:22,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:22,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:22,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:04:22,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:22,647 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:22,647 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 7 [2022-11-03 02:04:22,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:22,672 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:22,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:04:22,707 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:22,707 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 19 [2022-11-03 02:04:22,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:22,739 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:22,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:04:22,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:22,861 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 19 [2022-11-03 02:04:22,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:22,892 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:22,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, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:04:22,915 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:22,916 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 7 [2022-11-03 02:04:22,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:22,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:22,949 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:22,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:04:23,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:23,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:04:23,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:23,216 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:04:23,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:23,266 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:04:23,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 02:04:23,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:04:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:04:23,387 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:04:23,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 02:04:23,447 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:04:23,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 02:04:23,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:04:23,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:04:23,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:04:24,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:24,323 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:04:24,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:04:24,351 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:04:24,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:24,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:24,407 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:04:24,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:04:24,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:24,450 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:04:24,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:04:24,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:24,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:24,503 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:04:24,515 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:04:24,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:04:24,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:04:24,617 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 23 treesize of output 11 [2022-11-03 02:04:24,629 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:04:24,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:24,662 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:04:24,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:04:24,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:24,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:24,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:04:24,702 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 65 for LOIs [2022-11-03 02:04:24,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:04:24,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:04:24,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:24,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:04:24,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:24,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:24,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:24,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:24,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:24,898 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 19 treesize of output 1 [2022-11-03 02:04:24,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:24,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:24,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:04:24,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:24,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:24,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:04:24,988 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 13 treesize of output 9 [2022-11-03 02:04:25,007 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:04:41,131 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14398#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 |ULTIMATE.start_main_~ptr~0#1.offset|))) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)))' at error location [2022-11-03 02:04:41,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:04:41,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:04:41,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27] total 61 [2022-11-03 02:04:41,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520241427] [2022-11-03 02:04:41,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:04:41,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-03 02:04:41,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:41,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-03 02:04:41,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=10691, Unknown=14, NotChecked=0, Total=11130 [2022-11-03 02:04:41,133 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 62 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 51 states have internal predecessors, (92), 6 states have call successors, (6), 6 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-03 02:04:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:45,796 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-11-03 02:04:45,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 02:04:45,797 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 51 states have internal predecessors, (92), 6 states have call successors, (6), 6 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 52 [2022-11-03 02:04:45,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:45,798 INFO L225 Difference]: With dead ends: 87 [2022-11-03 02:04:45,798 INFO L226 Difference]: Without dead ends: 87 [2022-11-03 02:04:45,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5163 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=653, Invalid=15587, Unknown=16, NotChecked=0, Total=16256 [2022-11-03 02:04:45,799 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:45,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 901 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 761 Invalid, 0 Unknown, 240 Unchecked, 0.9s Time] [2022-11-03 02:04:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-03 02:04:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-03 02:04:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:04:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2022-11-03 02:04:45,803 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 52 [2022-11-03 02:04:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:45,803 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2022-11-03 02:04:45,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 51 states have internal predecessors, (92), 6 states have call successors, (6), 6 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-03 02:04:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-11-03 02:04:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-03 02:04:45,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:45,804 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:45,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:46,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-03 02:04:46,021 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 02:04:46,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:46,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1550251290, now seen corresponding path program 2 times [2022-11-03 02:04:46,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:46,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618966216] [2022-11-03 02:04:46,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:46,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:04:49,934 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:49,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618966216] [2022-11-03 02:04:49,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618966216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:49,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701788409] [2022-11-03 02:04:49,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:04:49,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:49,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:49,936 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:49,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 02:04:51,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:04:51,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:04:51,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 143 conjunts are in the unsatisfiable core [2022-11-03 02:04:51,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:51,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:04:51,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:51,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:51,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:04:51,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:51,600 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-03 02:04:51,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:51,904 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 02:04:51,904 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-03 02:04:52,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:52,296 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:04:52,296 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 33 treesize of output 32 [2022-11-03 02:04:52,563 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:04:52,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-11-03 02:04:52,704 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 78 treesize of output 49 [2022-11-03 02:04:52,889 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-03 02:04:52,889 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 70 treesize of output 25 [2022-11-03 02:04:52,896 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-03 02:04:52,901 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-03 02:04:53,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:53,470 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:04:53,470 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 78 treesize of output 68 [2022-11-03 02:04:53,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:53,479 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 68 treesize of output 64 [2022-11-03 02:04:53,508 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-03 02:04:53,509 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 32 treesize of output 34 [2022-11-03 02:04:54,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:54,698 INFO L356 Elim1Store]: treesize reduction 86, result has 11.3 percent of original size [2022-11-03 02:04:54,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 48 [2022-11-03 02:04:54,717 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 02:04:54,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:04:54,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:54,969 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:04:54,969 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 55 [2022-11-03 02:04:54,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:54,981 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 02:04:54,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 50 [2022-11-03 02:04:55,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:55,222 INFO L356 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-03 02:04:55,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 77 [2022-11-03 02:04:55,248 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-03 02:04:55,249 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 3 case distinctions, treesize of input 132 treesize of output 118 [2022-11-03 02:04:55,487 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-03 02:04:55,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 247 treesize of output 166 [2022-11-03 02:04:55,514 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-03 02:04:55,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 177 [2022-11-03 02:04:56,074 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-03 02:04:56,074 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 223 treesize of output 118 [2022-11-03 02:04:56,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:56,387 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 02:04:56,388 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 107 treesize of output 41 [2022-11-03 02:04:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:04:56,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:04:56,434 INFO L356 Elim1Store]: treesize reduction 5, result has 91.2 percent of original size [2022-11-03 02:04:56,435 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 61 treesize of output 60 [2022-11-03 02:04:56,441 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5770 (Array Int Int)) (v_ArrVal_5771 (Array Int Int))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5770)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) is different from false [2022-11-03 02:04:56,451 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5770 (Array Int Int)) (v_ArrVal_5771 (Array Int Int)) (v_ArrVal_5769 (Array Int Int))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5769) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5770)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) is different from false [2022-11-03 02:04:56,462 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:56,462 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 80 [2022-11-03 02:04:56,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5770 (Array Int Int)) (v_ArrVal_5771 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_5769 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5769) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5770)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5771))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) is different from false [2022-11-03 02:04:58,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5781 (Array Int Int)) (v_ArrVal_5770 (Array Int Int)) (v_ArrVal_5780 (Array Int Int)) (v_ArrVal_5771 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_5769 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_63| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_63| v_ArrVal_5781))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_63| v_ArrVal_5780)) (.cse6 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse7 (select .cse5 .cse6)) (.cse0 (select (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse8 (select .cse7 .cse0))) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_63| |c_#StackHeapBarrier|)) (not (<= 0 .cse0)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_63|) 0)) (= (let ((.cse4 (store (store (store .cse9 .cse6 (store (select .cse9 .cse6) .cse0 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_63| v_ArrVal_5769) .cse8 v_ArrVal_5770)) (.cse1 (store (store (store .cse5 .cse6 (store .cse7 .cse0 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_63|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_63| v_arrayElimArr_4) .cse8 v_ArrVal_5771))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3)))) .cse8) (not (= (select v_arrayElimArr_4 0) .cse8)))))))) is different from false [2022-11-03 02:04:58,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701788409] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:58,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1280420207] [2022-11-03 02:04:58,070 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-03 02:04:58,070 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:04:58,070 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:04:58,070 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:04:58,071 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:04:58,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:04:58,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:04:58,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:04:58,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:04:58,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:58,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:58,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 15 treesize of output 1 [2022-11-03 02:04:58,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:58,196 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 19 treesize of output 1 [2022-11-03 02:04:58,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:58,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:04:58,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:04:58,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:04:58,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:04:58,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:04:58,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:04:58,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,382 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:04:58,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:04:58,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:04:58,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:58,436 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:04:58,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:58,462 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:04:58,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,491 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:04:58,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:04:58,528 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:04:58,543 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:04:58,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:04:58,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:58,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:04:58,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:04:58,657 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 23 treesize of output 11 [2022-11-03 02:04:58,674 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:04:58,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:58,751 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:04:58,752 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:04:58,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:58,796 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:04:58,797 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:04:58,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:04:58,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:58,900 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:04:58,900 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:04:58,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,921 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 27 treesize of output 11 [2022-11-03 02:04:58,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:58,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:58,963 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:04:58,963 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:04:59,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:04:59,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:59,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:59,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:59,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:59,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:04:59,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:59,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:04:59,294 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:59,295 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 19 [2022-11-03 02:04:59,329 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:59,330 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 7 [2022-11-03 02:04:59,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:59,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:59,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:59,361 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:59,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:04:59,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:59,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:59,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:59,394 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:59,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:04:59,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:59,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:59,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:59,535 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:59,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:04:59,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:59,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:04:59,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:04:59,570 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:59,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:04:59,597 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:04:59,598 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 7 [2022-11-03 02:04:59,626 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:59,627 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 19 [2022-11-03 02:04:59,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:04:59,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:04:59,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:05:00,036 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:05:00,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 02:05:00,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:05:00,105 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:05:00,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:05:00,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:05:00,213 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:05:00,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 02:05:00,291 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:05:00,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 02:05:00,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:05:00,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:05:00,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:05:01,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:01,194 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:05:01,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:05:01,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:05:01,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:05:01,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:05:01,254 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:05:01,267 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:05:01,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:01,299 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:05:01,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:05:01,328 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:05:01,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:05:01,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:05:01,361 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:05:01,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:05:01,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:05:01,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:05:01,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:05:01,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:01,506 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:05:01,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:05:01,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:01,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:01,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:05:01,546 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 65 for LOIs [2022-11-03 02:05:01,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:05:01,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:05:01,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:05:01,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:05:01,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:05:01,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:01,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:05:01,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:01,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:05:01,750 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 19 treesize of output 1 [2022-11-03 02:05:01,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:01,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:01,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:05:01,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:01,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:01,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:05:01,890 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 13 treesize of output 9 [2022-11-03 02:05:01,895 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:05:18,482 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '14955#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|))' at error location [2022-11-03 02:05:18,482 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:05:18,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:05:18,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32] total 61 [2022-11-03 02:05:18,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200964127] [2022-11-03 02:05:18,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:05:18,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-03 02:05:18,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:18,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-03 02:05:18,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=9357, Unknown=7, NotChecked=788, Total=10506 [2022-11-03 02:05:18,484 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 63 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 54 states have internal predecessors, (94), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-03 02:05:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:23,410 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-11-03 02:05:23,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 02:05:23,411 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 54 states have internal predecessors, (94), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 55 [2022-11-03 02:05:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:23,412 INFO L225 Difference]: With dead ends: 119 [2022-11-03 02:05:23,412 INFO L226 Difference]: Without dead ends: 119 [2022-11-03 02:05:23,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=512, Invalid=12835, Unknown=9, NotChecked=924, Total=14280 [2022-11-03 02:05:23,413 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 65 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:23,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1017 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1994 Invalid, 0 Unknown, 169 Unchecked, 2.2s Time] [2022-11-03 02:05:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-03 02:05:23,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2022-11-03 02:05:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:05:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-11-03 02:05:23,417 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 55 [2022-11-03 02:05:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:23,417 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-11-03 02:05:23,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 53 states have (on average 1.7735849056603774) internal successors, (94), 54 states have internal predecessors, (94), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-03 02:05:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-11-03 02:05:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-03 02:05:23,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:23,418 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:05:23,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 02:05:23,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:23,619 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 02:05:23,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1550251289, now seen corresponding path program 2 times [2022-11-03 02:05:23,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:23,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487677866] [2022-11-03 02:05:23,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:05:28,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:28,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487677866] [2022-11-03 02:05:28,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487677866] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:05:28,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118509371] [2022-11-03 02:05:28,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:05:28,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:28,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:05:28,475 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:05:28,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 02:05:30,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:05:30,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:05:30,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 185 conjunts are in the unsatisfiable core [2022-11-03 02:05:30,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:30,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:05:30,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:05:31,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:05:31,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:05:31,817 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:05:31,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-03 02:05:31,838 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:05:31,838 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-03 02:05:32,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:05:32,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:05:32,479 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:05:32,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 52 treesize of output 47 [2022-11-03 02:05:32,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 18 treesize of output 20 [2022-11-03 02:05:32,903 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:05:32,904 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 63 treesize of output 56 [2022-11-03 02:05:32,912 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-03 02:05:33,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2022-11-03 02:05:33,112 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 118 treesize of output 65 [2022-11-03 02:05:33,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:05:33,324 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:05:33,324 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 124 treesize of output 51 [2022-11-03 02:05:33,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:33,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:33,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 16 [2022-11-03 02:05:33,341 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-03 02:05:33,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:05:33,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:33,978 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:05:33,978 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 134 treesize of output 110 [2022-11-03 02:05:33,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:33,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:33,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:34,005 INFO L356 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2022-11-03 02:05:34,005 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 125 [2022-11-03 02:05:34,031 INFO L356 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-11-03 02:05:34,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 02:05:34,062 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-03 02:05:34,063 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-03 02:05:35,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:35,614 INFO L356 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-03 02:05:35,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 138 [2022-11-03 02:05:35,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:05:35,639 INFO L356 Elim1Store]: treesize reduction 56, result has 11.1 percent of original size [2022-11-03 02:05:35,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 69 [2022-11-03 02:05:35,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:35,979 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:05:35,979 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 62 [2022-11-03 02:05:35,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2022-11-03 02:05:36,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:05:36,294 INFO L356 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-03 02:05:36,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 197 treesize of output 100 [2022-11-03 02:05:36,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,345 INFO L356 Elim1Store]: treesize reduction 84, result has 23.6 percent of original size [2022-11-03 02:05:36,346 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 189 treesize of output 131 [2022-11-03 02:05:36,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:05:36,672 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-11-03 02:05:36,672 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 179 treesize of output 109 [2022-11-03 02:05:36,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:36,700 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-11-03 02:05:36,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 82 [2022-11-03 02:05:37,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:05:37,844 INFO L356 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-03 02:05:37,844 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 265 treesize of output 105 [2022-11-03 02:05:37,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:37,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:37,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:37,865 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-03 02:05:37,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 28 [2022-11-03 02:05:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:05:38,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:05:47,104 WARN L234 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:05:51,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:51,620 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 371 treesize of output 336 [2022-11-03 02:05:51,628 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:51,629 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 329 treesize of output 294 [2022-11-03 02:05:51,651 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:51,651 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 176 [2022-11-03 02:05:51,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:51,660 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 152 [2022-11-03 02:05:59,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118509371] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:05:59,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [446596684] [2022-11-03 02:05:59,334 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2022-11-03 02:05:59,334 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:05:59,334 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:05:59,335 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:05:59,335 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:05:59,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:05:59,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:05:59,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:05:59,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:05:59,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:05:59,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:05:59,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:05:59,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:05:59,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:05:59,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:05:59,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:05:59,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:05:59,470 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 13 treesize of output 9 [2022-11-03 02:05:59,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:05:59,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:05:59,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:05:59,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,604 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:05:59,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:05:59,633 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:05:59,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:05:59,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:05:59,667 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:05:59,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:05:59,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,704 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:05:59,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:05:59,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:05:59,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:05:59,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:05:59,763 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:05:59,778 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:05:59,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:05:59,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,855 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 262 [2022-11-03 02:05:59,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:05:59,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:05:59,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 263 [2022-11-03 02:05:59,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:05:59,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:05:59,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 257 [2022-11-03 02:05:59,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:59,991 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 260 treesize of output 238 [2022-11-03 02:06:00,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:00,027 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 02:06:00,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 257 [2022-11-03 02:06:00,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:00,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:00,073 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 02:06:00,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 02:06:00,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:00,240 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 260 treesize of output 238 [2022-11-03 02:06:00,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:00,283 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 02:06:00,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 261 [2022-11-03 02:06:00,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:00,320 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 02:06:00,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 245 [2022-11-03 02:06:00,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:00,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:00,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:06:00,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:00,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:00,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:06:00,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:00,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:00,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:00,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:00,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:00,679 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:00,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:06:00,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:00,706 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 19 [2022-11-03 02:06:00,731 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:00,731 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 7 [2022-11-03 02:06:00,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:00,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:00,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:00,758 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:00,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:06:00,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:00,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:00,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:00,852 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:00,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:06:00,885 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:00,886 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 19 [2022-11-03 02:06:00,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:00,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:00,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:00,917 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:00,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:06:00,940 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:00,940 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 7 [2022-11-03 02:06:01,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:01,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:06:01,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:01,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:06:01,219 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:06:01,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:01,266 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:06:01,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 02:06:01,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:06:01,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:01,344 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:06:01,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 02:06:01,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:01,406 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:06:01,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 02:06:01,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:06:01,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:01,643 INFO L356 Elim1Store]: treesize reduction 54, result has 59.1 percent of original size [2022-11-03 02:06:01,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 113 [2022-11-03 02:06:01,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:01,793 INFO L356 Elim1Store]: treesize reduction 100, result has 24.2 percent of original size [2022-11-03 02:06:01,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 58 [2022-11-03 02:06:01,813 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-11-03 02:06:01,899 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-11-03 02:06:05,141 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-11-03 02:06:05,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:05,339 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:06:05,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:06:05,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:06:05,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:05,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:05,410 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:06:05,422 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:06:05,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:05,448 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:06:05,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:06:05,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:05,490 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:06:05,500 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:06:05,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:06:05,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:05,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:06:05,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:05,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:05,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:05,627 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:06:05,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:06:05,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:05,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:05,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:06:05,667 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 02:06:05,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:06:05,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:06:05,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:05,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:05,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:06:05,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:05,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:05,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:05,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:05,724 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 19 treesize of output 1 [2022-11-03 02:06:05,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:05,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:05,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:06:05,744 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 13 treesize of output 9 [2022-11-03 02:06:05,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:05,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:05,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:06:05,756 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:06:21,693 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15543#(and (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.offset|) (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |ULTIMATE.start_dll_circular_insert_~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_dll_circular_insert_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_circular_create_#in~len#1|) (<= |ULTIMATE.start_dll_circular_insert_~data#1| 1) (<= 1 |ULTIMATE.start_dll_circular_insert_#in~data#1|) (<= 1 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_dll_circular_create_#in~data#1| 1) (<= 0 |ULTIMATE.start_dll_circular_insert_#in~head#1.base|) (<= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) (<= |ULTIMATE.start_dll_circular_insert_~index#1| 0) (<= |ULTIMATE.start_dll_circular_insert_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.offset|) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_dll_circular_insert_~head#1.base|) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 12) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8)))) (<= 1 |ULTIMATE.start_dll_circular_create_#in~data#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_dll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_circular_insert_~head#1.offset| 0) (<= |ULTIMATE.start_dll_circular_create_#in~len#1| 2) (<= 0 |#NULL.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 1) (<= |ULTIMATE.start_dll_circular_create_~data#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|))' at error location [2022-11-03 02:06:21,693 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:06:21,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:06:21,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 65 [2022-11-03 02:06:21,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455569728] [2022-11-03 02:06:21,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 02:06:21,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-03 02:06:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:06:21,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-03 02:06:21,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=11764, Unknown=6, NotChecked=0, Total=12210 [2022-11-03 02:06:21,697 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 66 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 56 states have internal predecessors, (98), 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-03 02:06:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:27,161 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-11-03 02:06:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 02:06:27,162 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 56 states have internal predecessors, (98), 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 55 [2022-11-03 02:06:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:27,163 INFO L225 Difference]: With dead ends: 90 [2022-11-03 02:06:27,163 INFO L226 Difference]: Without dead ends: 90 [2022-11-03 02:06:27,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4351 ImplicationChecksByTransitivity, 47.2s TimeCoverageRelationStatistics Valid=593, Invalid=14651, Unknown=8, NotChecked=0, Total=15252 [2022-11-03 02:06:27,164 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 29 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:27,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 887 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1249 Invalid, 0 Unknown, 174 Unchecked, 1.7s Time] [2022-11-03 02:06:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-03 02:06:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-03 02:06:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:06:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-11-03 02:06:27,168 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 55 [2022-11-03 02:06:27,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:27,168 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-11-03 02:06:27,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 56 states have internal predecessors, (98), 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-03 02:06:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-11-03 02:06:27,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-03 02:06:27,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:27,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:06:27,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:27,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-03 02:06:27,370 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-03 02:06:27,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:27,370 INFO L85 PathProgramCache]: Analyzing trace with hash -813150673, now seen corresponding path program 1 times [2022-11-03 02:06:27,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:06:27,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198426729] [2022-11-03 02:06:27,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:27,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:06:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:06:30,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:06:30,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198426729] [2022-11-03 02:06:30,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198426729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:06:30,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250558060] [2022-11-03 02:06:30,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:30,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:06:30,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:06:30,916 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:06:30,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf9ec891-c68c-4384-80d5-bbf0d6488d33/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-03 02:06:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:31,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-03 02:06:31,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:06:31,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:06:31,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:31,537 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:06:31,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:06:31,728 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-03 02:06:31,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:31,913 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:06:31,913 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 1 case distinctions, treesize of input 16 treesize of output 14 [2022-11-03 02:06:32,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:32,287 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:06:32,288 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 34 treesize of output 33 [2022-11-03 02:06:32,553 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:06:32,553 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 36 treesize of output 35 [2022-11-03 02:06:32,695 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 61 treesize of output 40 [2022-11-03 02:06:32,844 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:32,845 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 58 treesize of output 25 [2022-11-03 02:06:32,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:06:32,856 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-03 02:06:33,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:33,153 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:06:33,153 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 66 treesize of output 56 [2022-11-03 02:06:33,201 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-03 02:06:33,201 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-03 02:06:33,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:33,221 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-03 02:06:34,131 INFO L356 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-03 02:06:34,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 71 [2022-11-03 02:06:34,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:34,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-11-03 02:06:34,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:34,317 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 02:06:34,318 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 58 treesize of output 58 [2022-11-03 02:06:34,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:34,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:34,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-11-03 02:06:34,388 INFO L356 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-11-03 02:06:34,388 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 67 [2022-11-03 02:06:34,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:34,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:34,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2022-11-03 02:06:34,592 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-03 02:06:34,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 138 [2022-11-03 02:06:34,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:34,622 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 02:06:34,623 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 134 treesize of output 116 [2022-11-03 02:06:35,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:35,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 81 [2022-11-03 02:06:35,463 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-03 02:06:35,463 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 121 treesize of output 39 [2022-11-03 02:06:35,467 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-03 02:06:35,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:06:35,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6298 (Array Int Int)) (v_ArrVal_6299 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6299))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6298))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))) is different from false [2022-11-03 02:06:35,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:35,823 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 91 [2022-11-03 02:06:35,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6298 (Array Int Int)) (v_ArrVal_6297 (Array Int Int)) (v_ArrVal_6299 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6299))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6297) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6298))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2)))))))))) is different from false [2022-11-03 02:06:37,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6298 (Array Int Int)) (v_ArrVal_6297 (Array Int Int)) (v_ArrVal_6299 (Array Int Int)) (v_ArrVal_6308 (Array Int Int)) (v_ArrVal_6309 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_71| Int) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_71| v_ArrVal_6309))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_71| v_ArrVal_6308)) (.cse5 (select (select .cse8 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse9 (select .cse8 .cse5)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse7 (select .cse9 .cse6))) (or (not (let ((.cse0 (store (store (store .cse8 .cse5 (store .cse9 .cse6 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_71|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_71| v_arrayElimArr_9) .cse7 v_ArrVal_6299))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_71| v_ArrVal_6297) .cse7 v_ArrVal_6298))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1)))) (not (= .cse7 (select v_arrayElimArr_9 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_71| |c_#StackHeapBarrier|)) (not (<= 0 .cse6)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_71|) 0)))))))) is different from false [2022-11-03 02:06:37,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250558060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:06:37,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1707621284] [2022-11-03 02:06:37,332 INFO L159 IcfgInterpreter]: Started Sifa with 38 locations of interest [2022-11-03 02:06:37,333 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:06:37,333 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:06:37,333 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:06:37,333 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:06:37,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:06:37,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:06:37,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:06:37,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:06:37,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:37,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:06:37,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:37,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:37,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:06:37,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:37,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:06:37,443 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 13 treesize of output 9 [2022-11-03 02:06:37,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:06:37,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:06:37,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:06:37,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 02:06:37,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,603 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:06:37,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:06:37,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:06:37,650 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:06:37,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:37,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:37,682 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:06:37,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,709 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:06:37,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:06:37,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:06:37,752 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:06:37,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:37,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:37,786 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:06:37,831 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 23 treesize of output 11 [2022-11-03 02:06:37,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:06:37,858 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:06:37,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 02:06:37,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:37,926 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:06:37,926 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:06:37,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:37,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:37,960 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:06:37,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:06:38,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:38,040 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 02:06:38,040 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:06:38,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:38,071 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:06:38,071 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:06:38,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:38,087 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 27 treesize of output 11 [2022-11-03 02:06:38,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:06:38,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:38,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:38,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:38,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:38,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:06:38,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:38,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:38,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:38,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:38,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:38,342 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:38,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:06:38,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:38,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:38,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:38,366 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:38,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:06:38,395 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:38,396 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 19 [2022-11-03 02:06:38,424 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:38,424 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 7 [2022-11-03 02:06:38,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:38,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:38,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:38,505 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:38,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:06:38,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:38,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:38,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:38,530 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:38,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 10 [2022-11-03 02:06:38,556 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 02:06:38,556 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 7 [2022-11-03 02:06:38,581 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:38,581 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 19 [2022-11-03 02:06:38,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:38,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:06:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:38,833 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-03 02:06:38,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:38,873 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 02:06:38,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-03 02:06:38,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:06:38,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:06:38,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:38,953 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:06:38,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2022-11-03 02:06:38,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:39,003 INFO L356 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-11-03 02:06:39,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2022-11-03 02:06:39,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:39,128 INFO L356 Elim1Store]: treesize reduction 100, result has 24.2 percent of original size [2022-11-03 02:06:39,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 58 [2022-11-03 02:06:39,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-03 02:06:39,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:39,292 INFO L356 Elim1Store]: treesize reduction 54, result has 59.1 percent of original size [2022-11-03 02:06:39,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 113 [2022-11-03 02:06:39,335 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-11-03 02:06:39,353 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-11-03 02:06:42,277 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-11-03 02:06:42,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:42,397 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:06:42,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:06:42,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:06:42,434 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:06:42,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:42,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:42,465 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:06:42,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:42,495 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:06:42,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:06:42,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:06:42,529 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:06:42,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:42,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 02:06:42,564 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:06:42,630 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 23 treesize of output 11 [2022-11-03 02:06:42,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:06:42,655 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 02:06:42,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:42,683 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:06:42,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 02:06:42,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:42,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:42,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-11-03 02:06:42,720 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 02:06:42,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:06:42,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:06:42,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:42,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 02:06:42,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:06:42,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:42,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:42,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:42,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:06:42,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 19 treesize of output 1 [2022-11-03 02:06:42,796 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 13 treesize of output 9 [2022-11-03 02:06:42,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:42,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:42,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:06:42,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:42,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:06:42,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:06:42,820 INFO L180 IcfgInterpreter]: Interpretation finished