./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- 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-4e7fbc6 [2022-11-23 14:08:00,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:08:00,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:08:00,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:08:00,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:08:00,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:08:00,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:08:00,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:08:00,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:08:00,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:08:00,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:08:00,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:08:00,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:08:00,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:08:00,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:08:00,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:08:00,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:08:00,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:08:00,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:08:00,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:08:00,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:08:00,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:08:00,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:08:00,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:08:00,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:08:00,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:08:00,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:08:00,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:08:00,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:08:00,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:08:00,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:08:00,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:08:00,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:08:00,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:08:00,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:08:00,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:08:00,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:08:00,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:08:00,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:08:00,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:08:00,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:08:00,971 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 14:08:01,000 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:08:01,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:08:01,006 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:08:01,006 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:08:01,007 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:08:01,007 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:08:01,008 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:08:01,008 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:08:01,008 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:08:01,008 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:08:01,009 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:08:01,009 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:08:01,009 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:08:01,011 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:08:01,011 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:08:01,011 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:08:01,012 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:08:01,012 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:08:01,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:08:01,014 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:08:01,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:08:01,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:08:01,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:08:01,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:08:01,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:08:01,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:08:01,016 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:08:01,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:08:01,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:08:01,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:08:01,018 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:08:01,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:08:01,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:08:01,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:08:01,019 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:08:01,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:08:01,021 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:08:01,021 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:08:01,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:08:01,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:08:01,022 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:08:01,022 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_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/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_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW 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 ! call(reach_error())) ) 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2022-11-23 14:08:01,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:08:01,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:08:01,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:08:01,369 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:08:01,369 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:08:01,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-11-23 14:08:04,508 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:08:04,747 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:08:04,748 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-11-23 14:08:04,760 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/data/c8f670367/d7990f0cb428415ba17678616d951a66/FLAGc24a2921a [2022-11-23 14:08:04,776 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/data/c8f670367/d7990f0cb428415ba17678616d951a66 [2022-11-23 14:08:04,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:08:04,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:08:04,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:08:04,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:08:04,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:08:04,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:08:04" (1/1) ... [2022-11-23 14:08:04,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640c08b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:04, skipping insertion in model container [2022-11-23 14:08:04,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:08:04" (1/1) ... [2022-11-23 14:08:04,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:08:04,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:08:05,245 WARN L237 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_2263c009-7546-4e34-afdc-78edd930fb22/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-11-23 14:08:05,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:08:05,273 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:08:05,336 WARN L237 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_2263c009-7546-4e34-afdc-78edd930fb22/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-11-23 14:08:05,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:08:05,372 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:08:05,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05 WrapperNode [2022-11-23 14:08:05,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:08:05,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:08:05,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:08:05,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:08:05,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05" (1/1) ... [2022-11-23 14:08:05,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05" (1/1) ... [2022-11-23 14:08:05,422 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 158 [2022-11-23 14:08:05,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:08:05,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:08:05,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:08:05,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:08:05,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05" (1/1) ... [2022-11-23 14:08:05,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05" (1/1) ... [2022-11-23 14:08:05,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05" (1/1) ... [2022-11-23 14:08:05,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05" (1/1) ... [2022-11-23 14:08:05,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05" (1/1) ... [2022-11-23 14:08:05,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05" (1/1) ... [2022-11-23 14:08:05,458 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05" (1/1) ... [2022-11-23 14:08:05,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05" (1/1) ... [2022-11-23 14:08:05,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:08:05,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:08:05,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:08:05,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:08:05,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05" (1/1) ... [2022-11-23 14:08:05,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:08:05,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:08:05,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:08:05,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:08:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 14:08:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 14:08:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-23 14:08:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-23 14:08:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 14:08:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:08:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:08:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 14:08:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 14:08:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:08:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 14:08:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:08:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:08:05,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:08:05,770 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:08:05,772 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:08:06,113 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:08:06,157 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:08:06,157 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-23 14:08:06,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:08:06 BoogieIcfgContainer [2022-11-23 14:08:06,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:08:06,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:08:06,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:08:06,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:08:06,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:08:04" (1/3) ... [2022-11-23 14:08:06,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d4150f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:08:06, skipping insertion in model container [2022-11-23 14:08:06,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:08:05" (2/3) ... [2022-11-23 14:08:06,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d4150f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:08:06, skipping insertion in model container [2022-11-23 14:08:06,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:08:06" (3/3) ... [2022-11-23 14:08:06,170 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2022-11-23 14:08:06,190 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:08:06,190 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 14:08:06,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:08:06,245 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@20c873e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:08:06,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 14:08:06,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 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-23 14:08:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 14:08:06,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:08:06,276 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:08:06,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:08:06,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:08:06,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1623736300, now seen corresponding path program 1 times [2022-11-23 14:08:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:08:06,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600719170] [2022-11-23 14:08:06,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:06,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:08:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:06,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:08:06,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:08:06,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600719170] [2022-11-23 14:08:06,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600719170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:08:06,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:08:06,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:08:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384330461] [2022-11-23 14:08:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:08:06,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:08:06,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:08:06,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:08:06,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:08:06,943 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 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, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-23 14:08:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:08:07,028 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2022-11-23 14:08:07,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:08:07,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 18 [2022-11-23 14:08:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:08:07,040 INFO L225 Difference]: With dead ends: 61 [2022-11-23 14:08:07,041 INFO L226 Difference]: Without dead ends: 29 [2022-11-23 14:08:07,059 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-23 14:08:07,063 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:08:07,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:08:07,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-23 14:08:07,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-23 14:08:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-23 14:08:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-11-23 14:08:07,124 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2022-11-23 14:08:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:08:07,126 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-11-23 14:08:07,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-23 14:08:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-11-23 14:08:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 14:08:07,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:08:07,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:08:07,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:08:07,130 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:08:07,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:08:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1105478418, now seen corresponding path program 1 times [2022-11-23 14:08:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:08:07,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195551432] [2022-11-23 14:08:07,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:07,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:08:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:08:08,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:08:08,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195551432] [2022-11-23 14:08:08,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195551432] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:08:08,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628211768] [2022-11-23 14:08:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:08,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:08:08,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:08:08,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:08:08,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 14:08:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:08,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-23 14:08:08,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:08:08,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-23 14:08:08,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:08,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-23 14:08:08,701 INFO L350 Elim1Store]: Elim1 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-23 14:08:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:08:08,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:08:08,815 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_12| Int) (v_ArrVal_184 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_12| v_ArrVal_184) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_12| |c_#StackHeapBarrier|)))) is different from false [2022-11-23 14:08:08,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628211768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:08:08,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2033387683] [2022-11-23 14:08:08,846 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-23 14:08:08,847 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:08:08,851 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:08:08,860 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:08:08,867 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:08:08,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:08,950 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:08:08,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:08:08,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:08,971 INFO L350 Elim1Store]: Elim1 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-23 14:08:09,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:08:09,037 INFO L350 Elim1Store]: Elim1 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-23 14:08:09,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:09,053 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:08:09,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:09,062 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:08:09,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:09,081 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:08:09,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:09,123 INFO L350 Elim1Store]: Elim1 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-23 14:08:09,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:09,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:08:09,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:09,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:08:09,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:09,247 INFO L350 Elim1Store]: Elim1 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-23 14:08:09,729 INFO L350 Elim1Store]: Elim1 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-23 14:08:09,740 INFO L350 Elim1Store]: Elim1 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-23 14:08:09,752 INFO L350 Elim1Store]: Elim1 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-23 14:08:09,764 INFO L350 Elim1Store]: Elim1 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-23 14:08:09,784 INFO L350 Elim1Store]: Elim1 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-23 14:08:09,800 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:09,802 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:09,808 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:09,810 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:09,814 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:10,175 INFO L350 Elim1Store]: Elim1 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-23 14:08:10,195 INFO L350 Elim1Store]: Elim1 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-23 14:08:10,208 INFO L350 Elim1Store]: Elim1 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-23 14:08:10,220 INFO L350 Elim1Store]: Elim1 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-23 14:08:10,231 INFO L350 Elim1Store]: Elim1 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-23 14:08:10,246 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:10,248 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:10,250 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:10,254 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:10,256 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:10,324 INFO L350 Elim1Store]: Elim1 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 11 [2022-11-23 14:08:10,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:08:10,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:10,355 INFO L350 Elim1Store]: Elim1 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-23 14:08:10,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:10,625 INFO L350 Elim1Store]: Elim1 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 140 treesize of output 124 [2022-11-23 14:08:10,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:10,644 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-23 14:08:10,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:10,658 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 128 treesize of output 116 [2022-11-23 14:08:10,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:08:10,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:08:10,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:08:11,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:11,091 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:11,091 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:08:11,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:11,120 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:11,121 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:08:11,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:11,279 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:11,280 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:08:11,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:11,300 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:11,300 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:08:11,485 INFO L350 Elim1Store]: Elim1 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 192 treesize of output 174 [2022-11-23 14:08:11,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:11,516 INFO L350 Elim1Store]: Elim1 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 192 treesize of output 174 [2022-11-23 14:08:11,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:11,563 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:08:11,565 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 186 [2022-11-23 14:08:11,606 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:11,625 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 14:08:11,626 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 178 [2022-11-23 14:08:12,014 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-23 14:08:12,026 INFO L350 Elim1Store]: Elim1 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-23 14:08:12,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:08:12,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:12,061 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:08:12,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:12,073 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:08:12,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:12,083 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:08:12,085 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:08:17,111 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '280#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |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|)) (= (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|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 4))) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_sll_circular_append_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| |ULTIMATE.start_sll_circular_append_~data#1|) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (< |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~last~2#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-23 14:08:17,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:08:17,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:08:17,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-11-23 14:08:17,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516538115] [2022-11-23 14:08:17,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:08:17,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 14:08:17,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:08:17,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 14:08:17,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1139, Unknown=1, NotChecked=68, Total=1332 [2022-11-23 14:08:17,117 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 14:08:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:08:17,575 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-11-23 14:08:17,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 14:08:17,576 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2022-11-23 14:08:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:08:17,577 INFO L225 Difference]: With dead ends: 40 [2022-11-23 14:08:17,577 INFO L226 Difference]: Without dead ends: 29 [2022-11-23 14:08:17,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=179, Invalid=1546, Unknown=1, NotChecked=80, Total=1806 [2022-11-23 14:08:17,579 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 62 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:08:17,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 212 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:08:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-23 14:08:17,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-23 14:08:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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-23 14:08:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-23 14:08:17,586 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 25 [2022-11-23 14:08:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:08:17,586 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-23 14:08:17,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 14:08:17,587 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-23 14:08:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 14:08:17,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:08:17,588 INFO L195 NwaCegarLoop]: trace histogram [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-23 14:08:17,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 14:08:17,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:08:17,795 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:08:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:08:17,796 INFO L85 PathProgramCache]: Analyzing trace with hash 871403401, now seen corresponding path program 1 times [2022-11-23 14:08:17,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:08:17,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799916281] [2022-11-23 14:08:17,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:17,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:08:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:08:19,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:08:19,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799916281] [2022-11-23 14:08:19,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799916281] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:08:19,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666497372] [2022-11-23 14:08:19,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:19,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:08:19,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:08:19,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:08:19,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 14:08:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:19,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-23 14:08:19,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:08:19,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:08:19,359 INFO L350 Elim1Store]: Elim1 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-23 14:08:19,456 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:08:19,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 14:08:19,596 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:19,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:08:19,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:08:19,745 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-23 14:08:19,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-23 14:08:19,857 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2022-11-23 14:08:19,880 INFO L350 Elim1Store]: Elim1 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-23 14:08:19,985 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 14:08:19,986 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 45 [2022-11-23 14:08:19,998 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 28 [2022-11-23 14:08:20,135 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:08:20,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2022-11-23 14:08:20,148 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:20,148 INFO L350 Elim1Store]: Elim1 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 10 [2022-11-23 14:08:20,155 INFO L350 Elim1Store]: Elim1 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-23 14:08:20,160 INFO L350 Elim1Store]: Elim1 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-23 14:08:20,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:20,397 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 14:08:20,398 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 52 [2022-11-23 14:08:20,417 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 14:08:20,418 INFO L350 Elim1Store]: Elim1 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-23 14:08:20,429 INFO L350 Elim1Store]: Elim1 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-23 14:08:20,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:20,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:20,453 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-23 14:08:20,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-11-23 14:08:20,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:20,473 INFO L350 Elim1Store]: Elim1 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-23 14:08:20,908 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-23 14:08:20,909 INFO L350 Elim1Store]: Elim1 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 105 treesize of output 77 [2022-11-23 14:08:20,939 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-23 14:08:20,940 INFO L350 Elim1Store]: Elim1 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 141 treesize of output 104 [2022-11-23 14:08:20,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:20,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:20,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-23 14:08:20,977 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-23 14:08:20,977 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 44 [2022-11-23 14:08:20,985 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 32 [2022-11-23 14:08:21,212 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2022-11-23 14:08:21,488 INFO L321 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-11-23 14:08:21,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 73 [2022-11-23 14:08:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:08:21,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:08:22,169 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_347 (Array Int Int)) (v_ArrVal_341 Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_340))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_343) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_347) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_341)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_342) .cse1) (+ .cse2 4))) (not (= .cse1 (select (select .cse3 .cse1) .cse2)))))))) is different from false [2022-11-23 14:08:22,188 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_347 (Array Int Int)) (v_ArrVal_341 Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_340))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_343) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_347) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) .cse2))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse3 (store (select |c_#memory_int| .cse3) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_341)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_342) .cse0) (+ .cse2 4)))))))) is different from false [2022-11-23 14:08:22,304 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| Int) (v_ArrVal_359 (Array Int Int)) (v_ArrVal_358 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (v_ArrVal_341 Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int)) (v_ArrVal_357 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_358))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (store (store .cse5 .cse4 (store (select .cse5 .cse4) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_340))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_357) .cse4 v_ArrVal_343) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_347) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) .cse2))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_359))) (store .cse3 .cse4 (store (select .cse3 .cse4) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_341))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_342) .cse0) (+ .cse2 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| |c_#StackHeapBarrier|)))))))) is different from false [2022-11-23 14:08:22,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666497372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:08:22,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1049041195] [2022-11-23 14:08:22,310 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-23 14:08:22,310 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:08:22,310 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:08:22,311 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:08:22,311 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:08:22,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:22,342 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 14:08:22,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 26 [2022-11-23 14:08:22,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:22,368 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:08:22,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:08:22,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:08:22,400 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:22,408 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:08:22,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:22,415 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:08:22,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:22,425 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:08:22,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:22,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:08:22,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:22,458 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:22,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:08:22,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:22,510 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,581 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,589 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,599 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,607 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,618 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,658 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,666 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,674 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,684 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,695 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:22,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:22,772 INFO L350 Elim1Store]: Elim1 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 221 treesize of output 205 [2022-11-23 14:08:22,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:22,786 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 207 [2022-11-23 14:08:22,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:22,802 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 110 [2022-11-23 14:08:22,916 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,926 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,937 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,947 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,956 INFO L350 Elim1Store]: Elim1 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-23 14:08:22,997 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,006 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,014 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,022 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,036 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,082 INFO L350 Elim1Store]: Elim1 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 11 [2022-11-23 14:08:23,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:08:23,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:23,104 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,192 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,202 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,211 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,224 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,235 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,277 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,287 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,304 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,314 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,331 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:23,416 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:08:23,416 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 26 treesize of output 21 [2022-11-23 14:08:23,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:23,436 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 13 [2022-11-23 14:08:23,465 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:08:23,465 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 34 treesize of output 25 [2022-11-23 14:08:23,574 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,595 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:23,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:23,616 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:23,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:08:23,635 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:23,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:23,659 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:23,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:08:23,727 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:23,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:23,751 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:23,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:08:23,769 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,781 INFO L350 Elim1Store]: Elim1 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-23 14:08:23,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:23,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:23,801 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:23,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:08:23,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:24,087 INFO L321 Elim1Store]: treesize reduction 95, result has 36.2 percent of original size [2022-11-23 14:08:24,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 119 treesize of output 137 [2022-11-23 14:08:24,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:24,222 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-23 14:08:24,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 49 [2022-11-23 14:08:24,244 INFO L350 Elim1Store]: Elim1 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-23 14:08:24,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:08:24,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-23 14:08:24,296 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:24,308 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:24,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:24,413 INFO L321 Elim1Store]: treesize reduction 120, result has 19.5 percent of original size [2022-11-23 14:08:24,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 115 treesize of output 108 [2022-11-23 14:08:24,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:24,492 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-23 14:08:24,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 45 [2022-11-23 14:08:24,511 INFO L350 Elim1Store]: Elim1 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-23 14:08:24,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:24,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:08:24,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 14:08:24,684 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-23 14:08:24,684 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-23 14:08:25,761 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-23 14:08:25,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:08:25,773 INFO L350 Elim1Store]: Elim1 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-23 14:08:25,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:25,787 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:08:25,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:25,794 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:08:25,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:25,801 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:08:25,803 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:08:32,378 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse7 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse22 (not .cse7)) (.cse4 (not .cse8))) (let ((.cse3 (or .cse22 .cse4)) (.cse0 (not .cse1))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (< 0 |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 5 |c_ULTIMATE.start_sll_circular_append_~data#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| 5) (<= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (< |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_#NULL.offset| 0) (<= |c_ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |c_ULTIMATE.start_sll_circular_append_#in~data#1| |c_ULTIMATE.start_sll_circular_append_~data#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_sll_circular_create_~data#1|) (= (+ |c_ULTIMATE.start_sll_circular_create_~len#1| 1) |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= 2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_#NULL.base| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) .cse0) (<= |c_ULTIMATE.start_sll_circular_append_~data#1| 5) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4) .cse1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_sll_circular_append_~data#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (let ((.cse2 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (or (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (and .cse2 .cse3 (or .cse4 (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse5 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= .cse6 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (or (and .cse7 .cse8) (= (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (and .cse2 .cse7 .cse8 (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_DerPreprocessor_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_4 (Array Int Int))) (let ((.cse9 (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse9 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= v_DerPreprocessor_4 .cse9)))))) (exists ((v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_DerPreprocessor_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_4 (Array Int Int))) (let ((.cse10 (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= (select (select .cse10 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse11 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= v_DerPreprocessor_4 .cse11)))))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse6)))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (<= 5 |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.base|) (let ((.cse14 (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| 0))) (.cse13 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (.cse17 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and .cse7 (= .cse12 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse8 .cse13 (or (and .cse14 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse18 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse15 (select .cse18 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse16 (select (select .cse18 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse15 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse16 .cse17) (= .cse15 v_DerPreprocessor_6) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse16) (= .cse16 (select v_DerPreprocessor_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse21 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse20 (select (select .cse21 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse19 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse20 .cse17) (not (= .cse20 0)) (= .cse19 v_DerPreprocessor_6) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse20) (= .cse20 (select v_DerPreprocessor_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))))) (and (or .cse14 (not (= .cse17 0))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse17) .cse3 .cse13 (= .cse12 .cse17) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| .cse17) (and .cse22 .cse0) .cse4)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 8) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (< |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_create_~len#1| 1) (= |c_ULTIMATE.start_main_~len~0#1| 2))))) is different from true [2022-11-23 14:08:36,349 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse9 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse24 (not .cse9)) (.cse6 (not .cse10))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (or .cse24 .cse6)) (.cse2 (not .cse3))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~2#1.base|) |c_ULTIMATE.start_main_~last~2#1.offset|) .cse0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (< 0 |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 5 |c_ULTIMATE.start_sll_circular_append_~data#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| 5) (<= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (< |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_#NULL.offset| 0) (<= |c_ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |c_ULTIMATE.start_sll_circular_append_#in~data#1| |c_ULTIMATE.start_sll_circular_append_~data#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_~len#1|) (= |c_ULTIMATE.start_main_#t~mem22#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_sll_circular_create_~data#1|) (= (+ |c_ULTIMATE.start_sll_circular_create_~len#1| 1) |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse1) (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= 2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_#NULL.base| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~2#1.base|) |c_ULTIMATE.start_main_~last~2#1.offset|) .cse1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) .cse2) (<= |c_ULTIMATE.start_sll_circular_append_~data#1| 5) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~last~2#1.offset| .cse1) (= |c_ULTIMATE.start_main_~last~2#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4) .cse3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_sll_circular_append_~data#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (or (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (and .cse4 .cse5 (or .cse6 (and (or .cse2 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse7 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= .cse8 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (or (and .cse9 .cse10) (= (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (and .cse4 .cse9 .cse10 (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_DerPreprocessor_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_4 (Array Int Int))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse11 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= v_DerPreprocessor_4 .cse11)))))) (exists ((v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_DerPreprocessor_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_4 (Array Int Int))) (let ((.cse12 (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse13 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= v_DerPreprocessor_4 .cse13)))))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse8)))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (<= 5 |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.base|) (let ((.cse16 (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| 0))) (.cse15 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (.cse19 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and .cse9 (= .cse14 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse10 .cse15 (or (and .cse16 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse20 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse18 (select (select .cse20 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse17 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse18 .cse19) (= .cse17 v_DerPreprocessor_6) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse18) (= .cse18 (select v_DerPreprocessor_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse23 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse21 (select .cse23 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse22 (select (select .cse23 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse21 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse22 .cse19) (not (= .cse22 0)) (= .cse21 v_DerPreprocessor_6) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse22) (= .cse22 (select v_DerPreprocessor_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))))) (and (or .cse16 (not (= .cse19 0))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse19) .cse5 .cse15 (= .cse14 .cse19) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| .cse19) (and .cse24 .cse2) .cse6)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 8) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (< |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_create_~len#1| 1) (= |c_ULTIMATE.start_main_~len~0#1| 2))))) is different from true [2022-11-23 14:08:36,351 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '561#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (and (= v_DerPreprocessor_6 (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select v_DerPreprocessor_7 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_sll_circular_append_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (= |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|)) (= (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|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_sll_circular_append_#in~data#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (not (= 2 |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (= |#NULL.offset| 0) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| |ULTIMATE.start_sll_circular_append_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) (= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (< |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|) (< 0 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~last~2#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-23 14:08:36,351 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:08:36,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:08:36,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 37 [2022-11-23 14:08:36,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468005510] [2022-11-23 14:08:36,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:08:36,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-23 14:08:36,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:08:36,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-23 14:08:36,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3423, Unknown=49, NotChecked=610, Total=4290 [2022-11-23 14:08:36,355 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 37 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-23 14:08:39,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:08:42,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:08:42,163 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-11-23 14:08:42,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 14:08:42,164 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 28 [2022-11-23 14:08:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:08:42,165 INFO L225 Difference]: With dead ends: 78 [2022-11-23 14:08:42,166 INFO L226 Difference]: Without dead ends: 70 [2022-11-23 14:08:42,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=481, Invalid=6119, Unknown=62, NotChecked=820, Total=7482 [2022-11-23 14:08:42,168 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 283 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:08:42,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 278 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 720 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-11-23 14:08:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-23 14:08:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 33. [2022-11-23 14:08:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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-23 14:08:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-11-23 14:08:42,181 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 28 [2022-11-23 14:08:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:08:42,181 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-11-23 14:08:42,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-23 14:08:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-11-23 14:08:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 14:08:42,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:08:42,183 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:08:42,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 14:08:42,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:08:42,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:08:42,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:08:42,392 INFO L85 PathProgramCache]: Analyzing trace with hash -53225596, now seen corresponding path program 1 times [2022-11-23 14:08:42,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:08:42,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671905230] [2022-11-23 14:08:42,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:08:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 14:08:43,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:08:43,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671905230] [2022-11-23 14:08:43,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671905230] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:08:43,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968990692] [2022-11-23 14:08:43,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:08:43,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:08:43,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:08:43,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:08:43,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 14:08:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:08:43,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-23 14:08:43,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:08:43,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:08:43,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:08:43,954 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:08:43,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 14:08:44,050 INFO L350 Elim1Store]: Elim1 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-23 14:08:44,143 INFO L350 Elim1Store]: Elim1 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-23 14:08:44,264 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 20 [2022-11-23 14:08:44,270 INFO L350 Elim1Store]: Elim1 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-23 14:08:44,275 INFO L350 Elim1Store]: Elim1 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-23 14:08:44,280 INFO L350 Elim1Store]: Elim1 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-23 14:08:44,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:44,455 INFO L350 Elim1Store]: Elim1 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-23 14:08:44,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:44,476 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 40 [2022-11-23 14:08:44,503 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-23 14:08:44,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-23 14:08:44,513 INFO L350 Elim1Store]: Elim1 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-23 14:08:44,861 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:08:44,862 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 71 [2022-11-23 14:08:44,887 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-23 14:08:44,887 INFO L350 Elim1Store]: Elim1 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 139 treesize of output 114 [2022-11-23 14:08:44,896 INFO L350 Elim1Store]: Elim1 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 50 treesize of output 48 [2022-11-23 14:08:44,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:44,924 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-23 14:08:44,925 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 88 treesize of output 87 [2022-11-23 14:08:44,937 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 32 [2022-11-23 14:08:45,037 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:45,038 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 28 [2022-11-23 14:08:45,139 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2022-11-23 14:08:45,242 INFO L350 Elim1Store]: Elim1 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-23 14:08:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:08:45,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:08:45,448 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_517 Int) (v_ArrVal_520 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_517)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_513) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_519) |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_sll_circular_append_~last~1#1.base| v_ArrVal_516) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-23 14:08:46,327 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_528 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_529 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| Int) (v_ArrVal_517 Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_530 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_529))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_528)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_530))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_517))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_513) (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_519) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store .cse4 .cse1 v_ArrVal_516) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_520) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|) 0)))) is different from false [2022-11-23 14:08:46,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968990692] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:08:46,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1052587206] [2022-11-23 14:08:46,332 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-23 14:08:46,332 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:08:46,332 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:08:46,333 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:08:46,333 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:08:46,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:46,362 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 14:08:46,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 26 [2022-11-23 14:08:46,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:46,390 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:08:46,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:08:46,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:08:46,418 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:46,427 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:08:46,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:46,433 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:08:46,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:46,448 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:08:46,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:46,469 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:46,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:08:46,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:46,515 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:46,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:08:46,592 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,600 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,609 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,632 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,640 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,681 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,691 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,699 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,711 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,719 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:46,788 INFO L350 Elim1Store]: Elim1 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-23 14:08:46,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:08:46,805 INFO L350 Elim1Store]: Elim1 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 11 [2022-11-23 14:08:47,103 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:47,105 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:47,107 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:47,109 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:47,112 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:47,123 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,149 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,162 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,171 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,180 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,400 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:47,402 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:47,403 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:47,406 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:47,407 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:47,418 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,427 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,436 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,447 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,456 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:47,504 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:08:47,523 INFO L350 Elim1Store]: Elim1 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 11 [2022-11-23 14:08:47,972 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,981 INFO L350 Elim1Store]: Elim1 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-23 14:08:47,992 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,001 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,012 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,025 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:48,026 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:48,028 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:48,030 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:48,032 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:48,227 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:48,229 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:48,231 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:48,233 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:48,236 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:48,245 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,254 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,263 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,275 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,284 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,368 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:08:48,368 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:08:48,382 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 11 [2022-11-23 14:08:48,408 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:08:48,408 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:08:48,481 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:48,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:48,500 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:48,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:08:48,513 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,525 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:48,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:48,550 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:48,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:08:48,629 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,642 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:48,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:48,664 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:48,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:08:48,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:48,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:48,692 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:08:48,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:08:48,704 INFO L350 Elim1Store]: Elim1 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-23 14:08:48,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:48,952 INFO L321 Elim1Store]: treesize reduction 95, result has 36.2 percent of original size [2022-11-23 14:08:48,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 119 treesize of output 137 [2022-11-23 14:08:48,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:49,052 INFO L321 Elim1Store]: treesize reduction 120, result has 19.5 percent of original size [2022-11-23 14:08:49,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 119 treesize of output 112 [2022-11-23 14:08:49,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:49,170 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-23 14:08:49,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 53 [2022-11-23 14:08:49,196 INFO L350 Elim1Store]: Elim1 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-23 14:08:49,233 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:08:49,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:08:49,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-23 14:08:49,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:49,347 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-23 14:08:49,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 74 [2022-11-23 14:08:49,366 INFO L350 Elim1Store]: Elim1 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-23 14:08:49,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:08:49,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-23 14:08:49,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:49,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:08:49,433 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-11-23 14:08:49,695 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-23 14:08:49,696 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-23 14:08:51,606 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-23 14:08:51,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:08:51,617 INFO L350 Elim1Store]: Elim1 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-23 14:08:51,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:51,631 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:08:51,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:51,638 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:08:51,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:08:51,645 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:08:51,647 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:08:59,697 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '947#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-23 14:08:59,697 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:08:59,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:08:59,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 38 [2022-11-23 14:08:59,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821361968] [2022-11-23 14:08:59,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:08:59,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 14:08:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:08:59,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 14:08:59,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=3423, Unknown=38, NotChecked=238, Total=3906 [2022-11-23 14:08:59,700 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 38 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 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-23 14:09:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:09:03,470 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-11-23 14:09:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 14:09:03,471 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 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 30 [2022-11-23 14:09:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:09:03,472 INFO L225 Difference]: With dead ends: 72 [2022-11-23 14:09:03,472 INFO L226 Difference]: Without dead ends: 58 [2022-11-23 14:09:03,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=490, Invalid=6122, Unknown=38, NotChecked=322, Total=6972 [2022-11-23 14:09:03,475 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 264 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:09:03,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 397 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 14:09:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-23 14:09:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-11-23 14:09:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 14:09:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-11-23 14:09:03,494 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 30 [2022-11-23 14:09:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:09:03,494 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-11-23 14:09:03,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 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-23 14:09:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-11-23 14:09:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 14:09:03,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:09:03,496 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:09:03,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 14:09:03,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:09:03,702 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:09:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:09:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash -325495100, now seen corresponding path program 1 times [2022-11-23 14:09:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:09:03,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352529160] [2022-11-23 14:09:03,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:09:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:09:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:09:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:09:05,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:09:05,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352529160] [2022-11-23 14:09:05,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352529160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:09:05,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984115630] [2022-11-23 14:09:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:09:05,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:09:05,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:09:05,315 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:09:05,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 14:09:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:09:05,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-23 14:09:05,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:09:05,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:09:05,764 INFO L350 Elim1Store]: Elim1 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-23 14:09:05,872 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:09:05,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 14:09:05,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:09:06,053 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 14:09:06,054 INFO L350 Elim1Store]: Elim1 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 71 treesize of output 58 [2022-11-23 14:09:06,159 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-11-23 14:09:06,159 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 34 [2022-11-23 14:09:06,171 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 14:09:06,177 INFO L350 Elim1Store]: Elim1 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-23 14:09:06,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:06,332 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 14:09:06,333 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 62 [2022-11-23 14:09:06,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:06,340 INFO L350 Elim1Store]: Elim1 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 59 [2022-11-23 14:09:06,364 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-23 14:09:06,365 INFO L350 Elim1Store]: Elim1 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-23 14:09:07,032 INFO L321 Elim1Store]: treesize reduction 104, result has 15.4 percent of original size [2022-11-23 14:09:07,033 INFO L350 Elim1Store]: Elim1 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 5 case distinctions, treesize of input 144 treesize of output 67 [2022-11-23 14:09:07,069 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-23 14:09:07,069 INFO L350 Elim1Store]: Elim1 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 174 treesize of output 107 [2022-11-23 14:09:07,095 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-23 14:09:07,096 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 148 [2022-11-23 14:09:07,214 INFO L350 Elim1Store]: Elim1 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 122 treesize of output 94 [2022-11-23 14:09:07,337 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2022-11-23 14:09:07,337 INFO L350 Elim1Store]: Elim1 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 109 treesize of output 44 [2022-11-23 14:09:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:09:07,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:09:07,361 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_680 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_684))) (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_sll_circular_append_~last~1#1.base| v_ArrVal_686) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-23 14:09:07,776 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_680 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (or (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_684))) (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 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_686) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) (not (= .cse4 (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14|)))))))) is different from false [2022-11-23 14:09:07,793 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_680 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (or (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_684))) (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| .cse2 v_ArrVal_686) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= .cse4 (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14|)))))))) is different from false [2022-11-23 14:09:07,889 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_680 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_691))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_692))) (let ((.cse5 (select (select .cse6 .cse1) (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (select .cse6 .cse5))) (or (not (= (select .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14|) .cse1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|) 0)) (not (let ((.cse3 (store (store .cse6 .cse5 (store .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_684))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 (select (select .cse3 .cse2) (select (select (store (store .cse4 .cse5 v_ArrVal_686) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_680) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| |c_#StackHeapBarrier|)))))))) is different from false [2022-11-23 14:09:07,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984115630] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:09:07,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1927159959] [2022-11-23 14:09:07,893 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-23 14:09:07,893 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:09:07,894 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:09:07,894 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:09:07,894 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:09:07,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:07,925 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 14:09:07,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 26 [2022-11-23 14:09:07,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:07,951 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:09:07,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:09:07,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:09:07,982 INFO L350 Elim1Store]: Elim1 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-23 14:09:07,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:07,990 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:09:07,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:07,998 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:09:08,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:08,008 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:09:08,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:08,027 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:08,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:09:08,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:08,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:09:08,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:08,092 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,151 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,159 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,168 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,178 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,187 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,222 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,230 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,238 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,247 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,257 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:09:08,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:08,303 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,313 INFO L350 Elim1Store]: Elim1 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 11 [2022-11-23 14:09:08,539 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:08,540 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:08,542 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:08,544 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:08,546 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:08,557 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,566 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,577 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,588 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,597 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,805 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,814 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,826 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,837 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,846 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,867 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:08,868 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:08,870 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:08,872 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:08,874 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:08,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:08,927 INFO L350 Elim1Store]: Elim1 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-23 14:09:08,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:09:08,954 INFO L350 Elim1Store]: Elim1 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 11 [2022-11-23 14:09:09,306 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:09,309 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:09,310 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:09,312 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:09,314 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:09,326 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,334 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,342 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,350 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,359 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,529 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,538 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,546 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,554 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,565 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,579 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:09,580 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:09,582 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:09,584 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:09,585 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:09,640 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 11 [2022-11-23 14:09:09,667 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:09:09,667 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:09:09,703 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:09:09,703 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:09:09,764 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:09,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:09,786 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:09:09,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:09:09,800 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:09,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:09,837 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:09:09,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:09:09,851 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,925 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:09,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:09,945 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:09:09,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:09:09,957 INFO L350 Elim1Store]: Elim1 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-23 14:09:09,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:09,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:09,978 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:09:09,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:09:09,993 INFO L350 Elim1Store]: Elim1 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-23 14:09:10,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:10,364 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-23 14:09:10,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-23 14:09:10,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:10,467 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-23 14:09:10,468 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-23 14:09:10,472 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:10,482 INFO L350 Elim1Store]: Elim1 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-23 14:09:10,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:10,590 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-23 14:09:10,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-23 14:09:10,668 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-23 14:09:10,668 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-23 14:09:10,685 INFO L350 Elim1Store]: Elim1 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-23 14:09:10,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:09:10,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-23 14:09:10,735 INFO L350 Elim1Store]: Elim1 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-23 14:09:10,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:10,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:10,754 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2022-11-23 14:09:10,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:09:10,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-23 14:09:10,887 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-23 14:09:10,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-23 14:09:11,578 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-23 14:09:11,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:09:11,592 INFO L350 Elim1Store]: Elim1 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-23 14:09:11,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:11,612 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:09:11,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:11,619 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:09:11,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:11,629 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:09:11,631 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:09:22,370 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1344#(and (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))))) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |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|)) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (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|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (or (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (exists ((v_DerPreprocessor_19 (Array Int Int))) (and (= (select v_DerPreprocessor_19 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (exists ((v_DerPreprocessor_18 (Array Int Int))) (and (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= v_DerPreprocessor_18 (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)))))) (and (exists ((v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (and (= (select v_DerPreprocessor_19 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= v_DerPreprocessor_18 (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#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_~last~2#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-23 14:09:22,370 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:09:22,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:09:22,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 40 [2022-11-23 14:09:22,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006674305] [2022-11-23 14:09:22,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:09:22,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-23 14:09:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:09:22,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-23 14:09:22,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3668, Unknown=41, NotChecked=500, Total=4422 [2022-11-23 14:09:22,374 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 40 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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-23 14:09:24,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:09:27,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:09:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:09:29,133 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2022-11-23 14:09:29,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 14:09:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 30 [2022-11-23 14:09:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:09:29,135 INFO L225 Difference]: With dead ends: 74 [2022-11-23 14:09:29,135 INFO L226 Difference]: Without dead ends: 66 [2022-11-23 14:09:29,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=436, Invalid=5859, Unknown=41, NotChecked=636, Total=6972 [2022-11-23 14:09:29,137 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 264 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 35 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:09:29,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 318 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 669 Invalid, 2 Unknown, 0 Unchecked, 4.8s Time] [2022-11-23 14:09:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-23 14:09:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2022-11-23 14:09:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 14:09:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2022-11-23 14:09:29,157 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2022-11-23 14:09:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:09:29,158 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2022-11-23 14:09:29,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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-23 14:09:29,158 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2022-11-23 14:09:29,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:09:29,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:09:29,159 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 14:09:29,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 14:09:29,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:09:29,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:09:29,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:09:29,372 INFO L85 PathProgramCache]: Analyzing trace with hash 778550271, now seen corresponding path program 1 times [2022-11-23 14:09:29,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:09:29,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062308989] [2022-11-23 14:09:29,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:09:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:09:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:09:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 14:09:31,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:09:31,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062308989] [2022-11-23 14:09:31,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062308989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:09:31,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167480082] [2022-11-23 14:09:31,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:09:31,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:09:31,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:09:31,744 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:09:31,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 14:09:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:09:32,315 WARN L261 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 194 conjunts are in the unsatisfiable core [2022-11-23 14:09:32,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:09:32,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:09:32,668 INFO L350 Elim1Store]: Elim1 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-23 14:09:32,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:09:32,843 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:09:32,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 14:09:32,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:09:32,968 INFO L350 Elim1Store]: Elim1 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-23 14:09:32,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:09:33,121 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 14:09:33,121 INFO L350 Elim1Store]: Elim1 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 83 treesize of output 58 [2022-11-23 14:09:33,127 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 28 [2022-11-23 14:09:33,137 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 28 [2022-11-23 14:09:33,285 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:09:33,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2022-11-23 14:09:33,291 INFO L350 Elim1Store]: Elim1 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-23 14:09:33,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:33,298 INFO L350 Elim1Store]: Elim1 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-23 14:09:33,302 INFO L350 Elim1Store]: Elim1 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-23 14:09:33,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:33,578 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 14:09:33,578 INFO L350 Elim1Store]: Elim1 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 89 treesize of output 75 [2022-11-23 14:09:33,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:33,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:33,609 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 14:09:33,609 INFO L350 Elim1Store]: Elim1 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-23 14:09:33,641 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 14:09:33,641 INFO L350 Elim1Store]: Elim1 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-23 14:09:33,651 INFO L350 Elim1Store]: Elim1 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-23 14:09:33,678 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-23 14:09:33,678 INFO L350 Elim1Store]: Elim1 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-23 14:09:34,980 INFO L321 Elim1Store]: treesize reduction 143, result has 15.4 percent of original size [2022-11-23 14:09:34,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 305 treesize of output 154 [2022-11-23 14:09:35,024 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-23 14:09:35,024 INFO L350 Elim1Store]: Elim1 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 427 treesize of output 278 [2022-11-23 14:09:35,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:35,086 INFO L321 Elim1Store]: treesize reduction 123, result has 14.0 percent of original size [2022-11-23 14:09:35,086 INFO L350 Elim1Store]: Elim1 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 7 new quantified variables, introduced 8 case distinctions, treesize of input 815 treesize of output 482 [2022-11-23 14:09:35,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:35,180 INFO L321 Elim1Store]: treesize reduction 369, result has 5.1 percent of original size [2022-11-23 14:09:35,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 10 new quantified variables, introduced 17 case distinctions, treesize of input 671 treesize of output 680 [2022-11-23 14:09:35,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:35,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:35,201 INFO L350 Elim1Store]: Elim1 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 61 treesize of output 65 [2022-11-23 14:09:35,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 173 [2022-11-23 14:09:35,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2022-11-23 14:09:35,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 173 [2022-11-23 14:09:35,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 316 treesize of output 129 [2022-11-23 14:09:35,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:36,016 INFO L321 Elim1Store]: treesize reduction 386, result has 3.3 percent of original size [2022-11-23 14:09:36,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 25 case distinctions, treesize of input 745 treesize of output 437 [2022-11-23 14:09:36,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 257 [2022-11-23 14:09:36,319 INFO L321 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-11-23 14:09:36,320 INFO L350 Elim1Store]: Elim1 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 53 [2022-11-23 14:09:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:09:36,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:09:36,878 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_867 (Array Int Int)) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_863 (Array Int Int)) (v_ArrVal_862 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_861)) (.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_867) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_863) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_862) .cse0) (+ .cse1 4))) (not (= (select (select .cse2 (select (select .cse2 .cse0) .cse1)) (select (select .cse3 .cse0) .cse1)) .cse0)))))) is different from false [2022-11-23 14:09:48,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167480082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:09:48,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [703829927] [2022-11-23 14:09:48,290 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-23 14:09:48,290 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:09:48,290 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:09:48,291 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:09:48,291 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:09:48,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:48,332 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 14:09:48,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 26 [2022-11-23 14:09:48,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:48,362 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:09:48,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:09:48,383 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:09:48,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:48,394 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:09:48,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:48,400 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:09:48,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:48,408 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:09:48,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:48,426 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:48,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:09:48,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:48,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:09:48,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:48,485 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,673 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,682 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,694 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,718 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,727 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,738 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:48,740 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:48,741 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:48,744 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:48,746 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:48,935 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,943 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,954 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,963 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,971 INFO L350 Elim1Store]: Elim1 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-23 14:09:48,982 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:48,984 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:48,985 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:48,987 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:48,989 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:49,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:49,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:49,063 INFO L350 Elim1Store]: Elim1 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 221 treesize of output 205 [2022-11-23 14:09:49,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:49,077 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 207 [2022-11-23 14:09:49,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:49,092 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 110 [2022-11-23 14:09:49,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:49,275 INFO L350 Elim1Store]: Elim1 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 140 treesize of output 124 [2022-11-23 14:09:49,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:49,286 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-23 14:09:49,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:49,299 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 132 treesize of output 120 [2022-11-23 14:09:49,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:09:49,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:09:49,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:09:49,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:49,608 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:09:49,608 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:09:49,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:49,627 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:09:49,627 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:09:49,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:49,734 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:09:49,734 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:09:49,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:49,751 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:09:49,751 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:09:49,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:49,969 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-23 14:09:49,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-23 14:09:50,041 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-23 14:09:50,041 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-23 14:09:50,059 INFO L350 Elim1Store]: Elim1 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-23 14:09:50,081 INFO L350 Elim1Store]: Elim1 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-23 14:09:50,104 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:09:50,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:09:50,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:50,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:50,124 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-11-23 14:09:50,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:09:50,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-23 14:09:50,166 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:50,174 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:09:50,300 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-23 14:09:50,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-23 14:09:50,323 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:50,408 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-23 14:09:50,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-23 14:09:50,490 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-23 14:09:50,490 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-23 14:09:50,506 INFO L350 Elim1Store]: Elim1 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-23 14:09:50,527 INFO L350 Elim1Store]: Elim1 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-23 14:09:50,554 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:09:50,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:09:50,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:09:50,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:09:50,587 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-11-23 14:09:50,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:09:50,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-23 14:09:50,640 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:02,809 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-23 14:10:02,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:10:02,822 INFO L350 Elim1Store]: Elim1 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-23 14:10:02,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:02,835 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:10:02,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:02,845 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:10:02,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:02,852 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:10:02,856 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:10:08,481 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1771#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-23 14:10:08,482 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:10:08,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:10:08,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 47 [2022-11-23 14:10:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873225623] [2022-11-23 14:10:08,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:10:08,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-23 14:10:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:10:08,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-23 14:10:08,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=5563, Unknown=8, NotChecked=150, Total=6006 [2022-11-23 14:10:08,486 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 47 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 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-23 14:10:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:10:13,807 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2022-11-23 14:10:13,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 14:10:13,808 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 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 32 [2022-11-23 14:10:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:10:13,809 INFO L225 Difference]: With dead ends: 76 [2022-11-23 14:10:13,809 INFO L226 Difference]: Without dead ends: 68 [2022-11-23 14:10:13,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1921 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=622, Invalid=8494, Unknown=8, NotChecked=188, Total=9312 [2022-11-23 14:10:13,814 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 217 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:10:13,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 533 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-23 14:10:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-23 14:10:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2022-11-23 14:10:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 14:10:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-11-23 14:10:13,833 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 32 [2022-11-23 14:10:13,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:10:13,833 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-11-23 14:10:13,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 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-23 14:10:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-11-23 14:10:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:10:13,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:10:13,835 INFO L195 NwaCegarLoop]: trace histogram [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-23 14:10:13,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 14:10:14,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-23 14:10:14,042 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:10:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:10:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash 506280767, now seen corresponding path program 2 times [2022-11-23 14:10:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:10:14,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264990705] [2022-11-23 14:10:14,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:10:14,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:10:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:10:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:10:15,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:10:15,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264990705] [2022-11-23 14:10:15,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264990705] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:10:15,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173968276] [2022-11-23 14:10:15,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:10:15,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:10:15,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:10:15,452 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:10:15,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 14:10:15,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 14:10:15,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:10:15,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-23 14:10:15,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:10:15,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:10:15,986 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-23 14:10:15,988 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-23 14:10:16,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:10:16,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:10:16,037 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2022-11-23 14:10:16,040 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from true [2022-11-23 14:10:16,073 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-23 14:10:16,074 INFO L350 Elim1Store]: Elim1 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 72 treesize of output 42 [2022-11-23 14:10:16,099 INFO L321 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2022-11-23 14:10:16,099 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 30 [2022-11-23 14:10:16,112 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)))) is different from false [2022-11-23 14:10:16,115 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)))) is different from true [2022-11-23 14:10:16,146 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-23 14:10:16,147 INFO L350 Elim1Store]: Elim1 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 77 treesize of output 43 [2022-11-23 14:10:16,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:16,160 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:10:16,160 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2022-11-23 14:10:16,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:16,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:16,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:16,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:16,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:16,266 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-23 14:10:16,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2022-11-23 14:10:16,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:16,296 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-23 14:10:16,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 77 [2022-11-23 14:10:16,352 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |v_old(#valid)_AFTER_CALL_68| .cse2))) |v_old(#valid)_AFTER_CALL_68|)))))) is different from false [2022-11-23 14:10:16,355 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |v_old(#valid)_AFTER_CALL_68| .cse2))) |v_old(#valid)_AFTER_CALL_68|)))))) is different from true [2022-11-23 14:10:16,403 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |v_old(#valid)_AFTER_CALL_68| .cse2))) |v_old(#valid)_AFTER_CALL_68|)))))) is different from false [2022-11-23 14:10:16,406 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |v_old(#valid)_AFTER_CALL_68| .cse2))) |v_old(#valid)_AFTER_CALL_68|)))))) is different from true [2022-11-23 14:10:16,446 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse4 (select |v_old(#valid)_AFTER_CALL_68| .cse4))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-23 14:10:16,449 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse4 (select |v_old(#valid)_AFTER_CALL_68| .cse4))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-23 14:10:16,535 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from false [2022-11-23 14:10:16,538 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from true [2022-11-23 14:10:16,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:16,630 INFO L321 Elim1Store]: treesize reduction 154, result has 4.3 percent of original size [2022-11-23 14:10:16,630 INFO L350 Elim1Store]: Elim1 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 14 case distinctions, treesize of input 96 treesize of output 51 [2022-11-23 14:10:16,641 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse2 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) 0)) 0)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-23 14:10:16,644 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse2 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) 0)) 0)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-23 14:10:16,667 INFO L321 Elim1Store]: treesize reduction 41, result has 16.3 percent of original size [2022-11-23 14:10:16,667 INFO L350 Elim1Store]: Elim1 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 77 treesize of output 41 [2022-11-23 14:10:16,683 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |v_old(#valid)_AFTER_CALL_68| .cse0))) |v_old(#valid)_AFTER_CALL_68|))) is different from false [2022-11-23 14:10:16,686 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |v_old(#valid)_AFTER_CALL_68| .cse0))) |v_old(#valid)_AFTER_CALL_68|))) is different from true [2022-11-23 14:10:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-23 14:10:16,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:10:17,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173968276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:10:17,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1687472613] [2022-11-23 14:10:17,013 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-23 14:10:17,013 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:10:17,014 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:10:17,014 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:10:17,014 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:10:17,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:17,047 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:10:17,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:10:17,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:17,057 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,077 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:10:17,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:17,088 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:10:17,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:17,094 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:10:17,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:17,103 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:10:17,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:17,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:10:17,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:17,134 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:17,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:10:17,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:17,179 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,382 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,391 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,399 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,410 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,424 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,435 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:17,437 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:17,439 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:17,440 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:17,442 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:17,602 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,612 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,621 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,630 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,639 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,651 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:17,653 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:17,654 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:17,656 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:17,657 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:17,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:10:17,702 INFO L350 Elim1Store]: Elim1 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 11 [2022-11-23 14:10:17,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:17,713 INFO L350 Elim1Store]: Elim1 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-23 14:10:17,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:17,867 INFO L350 Elim1Store]: Elim1 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 140 treesize of output 124 [2022-11-23 14:10:17,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:17,890 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-23 14:10:17,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:17,906 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 132 treesize of output 120 [2022-11-23 14:10:18,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:10:18,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:10:18,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:10:18,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:18,190 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:10:18,190 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:10:18,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:18,208 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:10:18,208 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:10:18,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:18,296 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:10:18,296 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:10:18,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:18,322 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:10:18,322 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-23 14:10:18,543 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-23 14:10:18,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-23 14:10:18,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:18,630 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-23 14:10:18,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-23 14:10:18,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:18,716 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-23 14:10:18,716 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-23 14:10:18,727 INFO L350 Elim1Store]: Elim1 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-23 14:10:18,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:18,821 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-23 14:10:18,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-23 14:10:18,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:18,902 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-23 14:10:18,903 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-23 14:10:18,913 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:18,925 INFO L350 Elim1Store]: Elim1 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-23 14:10:19,492 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-23 14:10:19,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:10:19,506 INFO L350 Elim1Store]: Elim1 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-23 14:10:19,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:19,518 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:10:19,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:19,529 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:10:19,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:19,538 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:10:19,539 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:10:30,097 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2186#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_DerPreprocessor_40 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) v_DerPreprocessor_39))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (exists ((v_DerPreprocessor_40 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_DerPreprocessor_40 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (exists ((v_DerPreprocessor_39 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) v_DerPreprocessor_39) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))))))))) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |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|)) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (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|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (or (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (exists ((v_DerPreprocessor_42 (Array Int Int))) (and (exists ((v_DerPreprocessor_41 (Array Int Int))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= v_DerPreprocessor_41 (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (= (select v_DerPreprocessor_42 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#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_~last~2#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-23 14:10:30,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:10:30,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:10:30,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2022-11-23 14:10:30,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076242517] [2022-11-23 14:10:30,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:10:30,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-23 14:10:30,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:10:30,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-23 14:10:30,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2367, Unknown=47, NotChecked=954, Total=3540 [2022-11-23 14:10:30,101 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 34 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 14:10:30,356 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-23 14:10:30,359 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-23 14:10:30,363 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= .cse1 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-23 14:10:30,366 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= .cse1 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-23 14:10:30,372 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.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$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse2) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse1) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse3) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_135| .cse4) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#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-23 14:10:30,375 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.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$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse2) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse1) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse3) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_135| .cse4) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#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-23 14:10:30,398 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-23 14:10:30,401 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-23 14:10:30,406 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-23 14:10:30,409 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-23 14:10:30,414 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse7 0))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) .cse4) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse3) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse4 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse5 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse3) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) .cse3))))) is different from false [2022-11-23 14:10:30,418 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse7 0))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) .cse4) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse3) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse4 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse5 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse3) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) .cse3))))) is different from true [2022-11-23 14:10:30,423 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse8 0)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse2) (= .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse5 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse6 0) 0) (= .cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse7 (select |v_old(#valid)_AFTER_CALL_68| .cse7))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-23 14:10:30,427 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse8 0)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse2) (= .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse5 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse6 0) 0) (= .cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse7 (select |v_old(#valid)_AFTER_CALL_68| .cse7))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-23 14:10:30,435 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse4 (select |v_old(#valid)_AFTER_CALL_68| .cse4))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse5))))) is different from false [2022-11-23 14:10:30,438 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse4 (select |v_old(#valid)_AFTER_CALL_68| .cse4))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse5))))) is different from true [2022-11-23 14:10:30,481 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from false [2022-11-23 14:10:30,484 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from true [2022-11-23 14:10:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:10:30,546 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2022-11-23 14:10:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 14:10:30,547 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2022-11-23 14:10:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:10:30,548 INFO L225 Difference]: With dead ends: 70 [2022-11-23 14:10:30,548 INFO L226 Difference]: Without dead ends: 56 [2022-11-23 14:10:30,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=210, Invalid=2659, Unknown=65, NotChecked=2178, Total=5112 [2022-11-23 14:10:30,551 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:10:30,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 203 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 157 Invalid, 0 Unknown, 271 Unchecked, 0.2s Time] [2022-11-23 14:10:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-23 14:10:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-23 14:10:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-23 14:10:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-11-23 14:10:30,575 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 32 [2022-11-23 14:10:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:10:30,575 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-11-23 14:10:30,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 14:10:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-11-23 14:10:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 14:10:30,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:10:30,577 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:10:30,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 14:10:30,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:10:30,783 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:10:30,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:10:30,783 INFO L85 PathProgramCache]: Analyzing trace with hash 909229690, now seen corresponding path program 2 times [2022-11-23 14:10:30,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:10:30,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643439947] [2022-11-23 14:10:30,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:10:30,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:10:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:10:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:10:33,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:10:33,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643439947] [2022-11-23 14:10:33,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643439947] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:10:33,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173760989] [2022-11-23 14:10:33,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:10:33,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:10:33,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:10:33,059 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:10:33,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 14:10:33,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 14:10:33,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:10:33,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-23 14:10:33,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:10:33,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 14:10:33,501 INFO L350 Elim1Store]: Elim1 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-23 14:10:33,610 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:10:33,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 14:10:33,774 INFO L350 Elim1Store]: Elim1 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-23 14:10:33,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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-23 14:10:33,937 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 14:10:33,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-23 14:10:34,044 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2022-11-23 14:10:34,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:10:34,189 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 14:10:34,190 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 51 [2022-11-23 14:10:34,195 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 28 [2022-11-23 14:10:34,335 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:10:34,335 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 33 [2022-11-23 14:10:34,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 14:10:34,348 INFO L350 Elim1Store]: Elim1 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-23 14:10:34,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:34,486 INFO L350 Elim1Store]: Elim1 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-23 14:10:34,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:34,511 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 14:10:34,511 INFO L350 Elim1Store]: Elim1 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 68 treesize of output 58 [2022-11-23 14:10:34,532 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 14:10:34,532 INFO L350 Elim1Store]: Elim1 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-23 14:10:34,537 INFO L350 Elim1Store]: Elim1 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-23 14:10:34,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:34,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:34,562 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-23 14:10:34,562 INFO L350 Elim1Store]: Elim1 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-23 14:10:35,142 INFO L321 Elim1Store]: treesize reduction 111, result has 14.0 percent of original size [2022-11-23 14:10:35,143 INFO L350 Elim1Store]: Elim1 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 157 treesize of output 83 [2022-11-23 14:10:35,177 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-23 14:10:35,177 INFO L350 Elim1Store]: Elim1 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 190 treesize of output 115 [2022-11-23 14:10:35,189 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 45 [2022-11-23 14:10:35,196 INFO L350 Elim1Store]: Elim1 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 50 treesize of output 44 [2022-11-23 14:10:35,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:35,202 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 28 [2022-11-23 14:10:35,343 INFO L321 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-11-23 14:10:35,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 42 [2022-11-23 14:10:35,348 INFO L350 Elim1Store]: Elim1 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-23 14:10:35,421 INFO L350 Elim1Store]: Elim1 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-23 14:10:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 14:10:35,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:10:35,590 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1198) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1193) |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_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-23 14:10:35,612 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1198) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-23 14:10:36,047 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1198) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-23 14:10:36,152 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1213)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1211))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1212) .cse0 v_ArrVal_1198) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1192) (select (select (store (store .cse1 .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 (store (select .cse2 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2022-11-23 14:10:36,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173760989] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:10:36,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1943365365] [2022-11-23 14:10:36,157 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-23 14:10:36,157 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 14:10:36,158 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 14:10:36,158 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 14:10:36,158 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 14:10:36,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:36,192 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 14:10:36,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-23 14:10:36,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:36,203 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:10:36,227 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:36,253 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:10:36,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:36,260 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:10:36,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:36,267 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:10:36,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:36,290 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:36,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:10:36,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:36,334 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:36,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 21 treesize of output 13 [2022-11-23 14:10:36,405 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,413 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,421 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,441 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,453 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,486 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,495 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,504 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,512 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,520 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:36,560 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 14:10:36,579 INFO L350 Elim1Store]: Elim1 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 11 [2022-11-23 14:10:36,646 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,654 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,664 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,673 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,684 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,720 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,728 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,737 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,745 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,754 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:36,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:36,830 INFO L350 Elim1Store]: Elim1 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 221 treesize of output 205 [2022-11-23 14:10:36,842 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:36,843 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 207 [2022-11-23 14:10:36,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:36,855 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 114 [2022-11-23 14:10:36,936 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,945 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,953 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,964 INFO L350 Elim1Store]: Elim1 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-23 14:10:36,976 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,013 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,023 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,038 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,048 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,058 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,146 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:10:37,147 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:10:37,162 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 11 [2022-11-23 14:10:37,189 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:10:37,190 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 14:10:37,255 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,267 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:37,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:37,288 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:10:37,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:10:37,307 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:37,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:37,330 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:10:37,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:10:37,378 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:37,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:37,402 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:10:37,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:10:37,427 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,439 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:37,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:37,463 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:10:37,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-23 14:10:37,738 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-23 14:10:37,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-23 14:10:37,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:37,828 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-23 14:10:37,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-23 14:10:37,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:37,909 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-23 14:10:37,909 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-23 14:10:37,921 INFO L350 Elim1Store]: Elim1 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-23 14:10:37,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:38,022 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-23 14:10:38,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-23 14:10:38,106 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-23 14:10:38,107 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-23 14:10:38,125 INFO L350 Elim1Store]: Elim1 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-23 14:10:38,142 INFO L350 Elim1Store]: Elim1 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-23 14:10:38,169 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:10:38,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:10:38,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:10:38,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:38,190 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-11-23 14:10:38,230 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 14:10:38,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 14:10:38,242 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:38,252 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 14:10:40,003 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-23 14:10:40,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 14:10:40,014 INFO L350 Elim1Store]: Elim1 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-23 14:10:40,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:40,025 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:10:40,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:40,034 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 14:10:40,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:10:40,042 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 14:10:40,043 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 14:10:46,554 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2604#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-23 14:10:46,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 14:10:46,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:10:46,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2022-11-23 14:10:46,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299312406] [2022-11-23 14:10:46,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 14:10:46,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-23 14:10:46,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:10:46,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-23 14:10:46,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3435, Unknown=43, NotChecked=484, Total=4160 [2022-11-23 14:10:46,557 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 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-23 14:10:49,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:10:52,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 14:10:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:10:55,402 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-11-23 14:10:55,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 14:10:55,403 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 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 34 [2022-11-23 14:10:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:10:55,404 INFO L225 Difference]: With dead ends: 100 [2022-11-23 14:10:55,404 INFO L226 Difference]: Without dead ends: 98 [2022-11-23 14:10:55,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=509, Invalid=6261, Unknown=52, NotChecked=660, Total=7482 [2022-11-23 14:10:55,406 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 339 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 44 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:10:55,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 291 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 761 Invalid, 3 Unknown, 0 Unchecked, 5.0s Time] [2022-11-23 14:10:55,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-23 14:10:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2022-11-23 14:10:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 56 states have internal predecessors, (68), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-23 14:10:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-11-23 14:10:55,435 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 34 [2022-11-23 14:10:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:10:55,435 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-11-23 14:10:55,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 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-23 14:10:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-11-23 14:10:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 14:10:55,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:10:55,436 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:10:55,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 14:10:55,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:10:55,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 14:10:55,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:10:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1496251498, now seen corresponding path program 1 times [2022-11-23 14:10:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:10:55,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848759878] [2022-11-23 14:10:55,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:10:55,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:10:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:10:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-23 14:10:56,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:10:56,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848759878] [2022-11-23 14:10:56,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848759878] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:10:56,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878591167] [2022-11-23 14:10:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:10:56,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:10:56,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:10:56,015 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:10:56,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2263c009-7546-4e34-afdc-78edd930fb22/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 14:10:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:10:56,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-23 14:10:56,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:10:57,008 INFO L321 Elim1Store]: treesize reduction 80, result has 79.6 percent of original size [2022-11-23 14:10:57,008 INFO L350 Elim1Store]: Elim1 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 14 new quantified variables, introduced 28 case distinctions, treesize of input 279 treesize of output 461 [2022-11-23 14:10:57,366 INFO L321 Elim1Store]: treesize reduction 72, result has 78.6 percent of original size [2022-11-23 14:10:57,367 INFO L350 Elim1Store]: Elim1 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 12 new quantified variables, introduced 28 case distinctions, treesize of input 491 treesize of output 555