./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh --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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- 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-2329fc7 [2022-12-14 09:42:14,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:42:14,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:42:14,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:42:14,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:42:14,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:42:14,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:42:14,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:42:14,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:42:14,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:42:14,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:42:14,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:42:14,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:42:14,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:42:14,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:42:14,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:42:14,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:42:14,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:42:14,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:42:14,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:42:14,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:42:14,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:42:14,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:42:14,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:42:14,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:42:14,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:42:14,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:42:14,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:42:14,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:42:14,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:42:14,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:42:14,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:42:14,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:42:14,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:42:14,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:42:14,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:42:14,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:42:14,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:42:14,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:42:14,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:42:14,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:42:14,660 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 09:42:14,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:42:14,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:42:14,683 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:42:14,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:42:14,684 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:42:14,685 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:42:14,685 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:42:14,685 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:42:14,685 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:42:14,685 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:42:14,685 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:42:14,686 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:42:14,686 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:42:14,686 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:42:14,686 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:42:14,686 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:42:14,687 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:42:14,687 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:42:14,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:42:14,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:42:14,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:42:14,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:42:14,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:42:14,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 09:42:14,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:42:14,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 09:42:14,689 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:42:14,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 09:42:14,689 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:42:14,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 09:42:14,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:42:14,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:42:14,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:42:14,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:42:14,691 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:42:14,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:42:14,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 09:42:14,691 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:42:14,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:42:14,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 09:42:14,692 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:42:14,692 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_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/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_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2022-12-14 09:42:14,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:42:14,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:42:14,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:42:14,905 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:42:14,905 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:42:14,906 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-12-14 09:42:17,460 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:42:17,638 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:42:17,638 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-12-14 09:42:17,645 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/data/9a5dda6a2/800d96a512774edda6c79ae9deb36380/FLAG097b2089f [2022-12-14 09:42:17,654 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/data/9a5dda6a2/800d96a512774edda6c79ae9deb36380 [2022-12-14 09:42:17,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:42:17,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:42:17,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:42:17,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:42:17,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:42:17,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8feb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17, skipping insertion in model container [2022-12-14 09:42:17,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:42:17,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:42:17,871 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_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2022-12-14 09:42:17,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:42:17,881 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:42:17,911 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_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2022-12-14 09:42:17,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:42:17,929 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:42:17,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17 WrapperNode [2022-12-14 09:42:17,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:42:17,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:42:17,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:42:17,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:42:17,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,961 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 146 [2022-12-14 09:42:17,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:42:17,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:42:17,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:42:17,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:42:17,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,983 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:42:17,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:42:17,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:42:17,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:42:17,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17" (1/1) ... [2022-12-14 09:42:17,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:42:18,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:42:18,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:42:18,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:42:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 09:42:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 09:42:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-14 09:42:18,049 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-14 09:42:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 09:42:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:42:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 09:42:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 09:42:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 09:42:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 09:42:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 09:42:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 09:42:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:42:18,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:42:18,148 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:42:18,150 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:42:18,334 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:42:18,360 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:42:18,360 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 09:42:18,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:42:18 BoogieIcfgContainer [2022-12-14 09:42:18,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:42:18,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:42:18,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:42:18,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:42:18,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:42:17" (1/3) ... [2022-12-14 09:42:18,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e31aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:42:18, skipping insertion in model container [2022-12-14 09:42:18,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:42:17" (2/3) ... [2022-12-14 09:42:18,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e31aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:42:18, skipping insertion in model container [2022-12-14 09:42:18,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:42:18" (3/3) ... [2022-12-14 09:42:18,369 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2022-12-14 09:42:18,384 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:42:18,385 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 09:42:18,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:42:18,424 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;@3bd28dba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:42:18,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 09:42:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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-12-14 09:42:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 09:42:18,433 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:42:18,434 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:42:18,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:42:18,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:42:18,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1759233044, now seen corresponding path program 1 times [2022-12-14 09:42:18,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:42:18,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454996116] [2022-12-14 09:42:18,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:18,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:42:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 09:42:18,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:42:18,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454996116] [2022-12-14 09:42:18,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454996116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:42:18,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:42:18,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:42:18,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587153988] [2022-12-14 09:42:18,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:42:18,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:42:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:42:18,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:42:18,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:42:18,780 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-12-14 09:42:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:42:18,828 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2022-12-14 09:42:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:42:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 16 [2022-12-14 09:42:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:42:18,837 INFO L225 Difference]: With dead ends: 55 [2022-12-14 09:42:18,837 INFO L226 Difference]: Without dead ends: 26 [2022-12-14 09:42:18,840 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-12-14 09:42:18,843 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:42:18,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:42:18,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-14 09:42:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-12-14 09:42:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-12-14 09:42:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-12-14 09:42:18,881 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2022-12-14 09:42:18,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:42:18,881 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-12-14 09:42:18,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-12-14 09:42:18,882 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-12-14 09:42:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 09:42:18,884 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:42:18,884 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:42:18,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 09:42:18,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:42:18,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:42:18,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1317636448, now seen corresponding path program 1 times [2022-12-14 09:42:18,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:42:18,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672567258] [2022-12-14 09:42:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:42:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:42:19,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:42:19,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672567258] [2022-12-14 09:42:19,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672567258] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:42:19,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294090811] [2022-12-14 09:42:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:19,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:42:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:42:19,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:42:19,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 09:42:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:19,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 09:42:19,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:42:19,677 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-12-14 09:42:19,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:19,749 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-12-14 09:42:19,783 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-12-14 09:42:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:42:19,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:42:19,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294090811] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:42:19,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [865816619] [2022-12-14 09:42:19,911 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 09:42:19,912 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:42:19,914 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:42:19,918 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:42:19,919 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:42:19,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:19,966 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:42:19,967 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-12-14 09:42:19,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:19,992 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:42:19,993 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-12-14 09:42:20,035 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-12-14 09:42:20,039 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-12-14 09:42:20,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:20,055 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-12-14 09:42:20,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:20,063 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-12-14 09:42:20,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:20,069 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-12-14 09:42:20,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:20,090 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-12-14 09:42:20,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:20,100 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-12-14 09:42:20,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:20,147 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-12-14 09:42:20,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:20,157 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-12-14 09:42:20,385 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-12-14 09:42:20,394 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-12-14 09:42:20,403 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-12-14 09:42:20,413 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-12-14 09:42:20,423 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-12-14 09:42:20,435 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:20,436 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:20,438 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:20,439 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:20,441 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:20,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-12-14 09:42:20,641 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-12-14 09:42:20,649 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-12-14 09:42:20,660 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-12-14 09:42:20,669 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-12-14 09:42:20,680 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:20,682 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:20,683 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:20,685 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:20,687 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:20,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:20,729 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-12-14 09:42:20,742 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-12-14 09:42:20,751 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-12-14 09:42:20,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:20,906 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-12-14 09:42:20,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:20,917 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-12-14 09:42:20,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:20,928 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-12-14 09:42:21,081 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-12-14 09:42:21,091 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-12-14 09:42:21,100 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-12-14 09:42:21,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:21,210 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:21,210 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-12-14 09:42:21,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:21,234 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:21,235 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-12-14 09:42:21,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:21,327 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:21,327 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-12-14 09:42:21,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:21,341 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:21,342 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-12-14 09:42:21,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:21,456 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-12-14 09:42:21,471 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-12-14 09:42:21,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:21,500 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:42:21,500 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-12-14 09:42:21,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:21,527 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:42:21,527 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-12-14 09:42:21,649 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-12-14 09:42:21,655 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-12-14 09:42:21,659 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-12-14 09:42:21,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:21,675 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-12-14 09:42:21,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:21,681 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-12-14 09:42:21,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:21,699 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-12-14 09:42:21,703 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:42:23,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [865816619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:42:23,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:42:23,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13, 13] total 33 [2022-12-14 09:42:23,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619638537] [2022-12-14 09:42:23,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:42:23,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 09:42:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:42:23,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 09:42:23,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1073, Unknown=5, NotChecked=0, Total=1190 [2022-12-14 09:42:23,974 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 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-12-14 09:42:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:42:24,341 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-12-14 09:42:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 09:42:24,342 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 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) Word has length 22 [2022-12-14 09:42:24,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:42:24,343 INFO L225 Difference]: With dead ends: 34 [2022-12-14 09:42:24,343 INFO L226 Difference]: Without dead ends: 32 [2022-12-14 09:42:24,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=112, Invalid=1073, Unknown=5, NotChecked=0, Total=1190 [2022-12-14 09:42:24,344 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:42:24,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 62 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 09:42:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-14 09:42:24,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-12-14 09:42:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-12-14 09:42:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-12-14 09:42:24,351 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 22 [2022-12-14 09:42:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:42:24,351 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-12-14 09:42:24,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 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-12-14 09:42:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-12-14 09:42:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 09:42:24,352 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:42:24,352 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] [2022-12-14 09:42:24,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:42:24,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:42:24,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:42:24,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:42:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash -766704741, now seen corresponding path program 1 times [2022-12-14 09:42:24,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:42:24,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032545076] [2022-12-14 09:42:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:24,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:42:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:42:24,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:42:24,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032545076] [2022-12-14 09:42:24,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032545076] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:42:24,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471284301] [2022-12-14 09:42:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:24,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:42:24,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:42:24,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:42:24,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 09:42:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:24,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 09:42:24,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:42:25,024 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-12-14 09:42:25,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:25,063 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-12-14 09:42:25,080 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-12-14 09:42:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:42:25,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:42:25,126 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_16| Int) (v_ArrVal_320 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_16| v_ArrVal_320) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 0)) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_16| |c_#StackHeapBarrier|)))) is different from false [2022-12-14 09:42:25,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471284301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:42:25,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1369490096] [2022-12-14 09:42:25,130 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-12-14 09:42:25,130 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:42:25,131 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:42:25,131 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:42:25,131 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:42:25,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:25,156 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:42:25,156 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-12-14 09:42:25,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:25,166 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-12-14 09:42:25,184 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-12-14 09:42:25,187 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-12-14 09:42:25,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:25,194 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-12-14 09:42:25,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:25,201 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-12-14 09:42:25,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:25,207 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-12-14 09:42:25,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:25,220 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-12-14 09:42:25,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:25,228 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-12-14 09:42:25,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:25,257 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-12-14 09:42:25,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:25,265 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-12-14 09:42:25,444 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-12-14 09:42:25,451 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-12-14 09:42:25,458 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-12-14 09:42:25,464 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-12-14 09:42:25,471 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-12-14 09:42:25,479 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:25,480 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:25,481 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:25,482 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:25,483 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:25,572 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-12-14 09:42:25,578 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-12-14 09:42:25,585 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-12-14 09:42:25,591 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-12-14 09:42:25,597 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-12-14 09:42:25,613 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:25,614 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:25,615 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:25,617 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:25,618 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:25,644 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-12-14 09:42:25,651 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-12-14 09:42:25,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:25,659 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-12-14 09:42:25,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:25,778 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-12-14 09:42:25,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:25,790 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-12-14 09:42:25,800 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:25,801 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-12-14 09:42:25,967 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-12-14 09:42:25,975 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-12-14 09:42:25,990 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-12-14 09:42:26,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:26,085 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:26,086 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-12-14 09:42:26,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:26,100 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:26,100 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-12-14 09:42:26,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:26,207 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:26,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-12-14 09:42:26,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:26,223 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:26,223 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-12-14 09:42:26,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:26,339 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 188 treesize of output 172 [2022-12-14 09:42:26,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:26,351 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 188 treesize of output 172 [2022-12-14 09:42:26,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:26,363 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:26,373 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:42:26,373 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 207 treesize of output 182 [2022-12-14 09:42:26,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:26,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:26,397 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:42:26,397 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 199 treesize of output 174 [2022-12-14 09:42:26,567 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-12-14 09:42:26,574 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-12-14 09:42:26,577 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-12-14 09:42:26,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:26,589 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-12-14 09:42:26,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:26,595 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-12-14 09:42:26,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:26,600 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-12-14 09:42:26,602 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:42:29,290 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '456#(and (= (select (select |#memory_$Pointer$.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.base|) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_sll_circular_prepend_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4)) (< |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| |ULTIMATE.start_sll_circular_prepend_~data#1|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset|) (= 8 (select |#length| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#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) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| (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_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset|) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (= 1 (select |#valid| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| |ULTIMATE.start_main_~uneq~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 09:42:29,291 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:42:29,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:42:29,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-12-14 09:42:29,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070769759] [2022-12-14 09:42:29,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:42:29,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 09:42:29,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:42:29,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 09:42:29,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1140, Unknown=1, NotChecked=68, Total=1332 [2022-12-14 09:42:29,293 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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-12-14 09:42:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:42:29,561 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-12-14 09:42:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 09:42:29,562 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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 24 [2022-12-14 09:42:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:42:29,563 INFO L225 Difference]: With dead ends: 34 [2022-12-14 09:42:29,563 INFO L226 Difference]: Without dead ends: 26 [2022-12-14 09:42:29,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=178, Invalid=1547, Unknown=1, NotChecked=80, Total=1806 [2022-12-14 09:42:29,564 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 80 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:42:29,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 180 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:42:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-14 09:42:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-12-14 09:42:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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-12-14 09:42:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-12-14 09:42:29,569 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 24 [2022-12-14 09:42:29,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:42:29,569 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-12-14 09:42:29,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 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-12-14 09:42:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-12-14 09:42:29,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 09:42:29,570 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:42:29,571 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-12-14 09:42:29,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 09:42:29,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:42:29,772 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:42:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:42:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash -845270189, now seen corresponding path program 1 times [2022-12-14 09:42:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:42:29,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816383890] [2022-12-14 09:42:29,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:29,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:42:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:42:30,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:42:30,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816383890] [2022-12-14 09:42:30,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816383890] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:42:30,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327930393] [2022-12-14 09:42:30,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:30,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:42:30,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:42:30,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:42:30,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 09:42:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:30,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 91 conjunts are in the unsatisfiable core [2022-12-14 09:42:30,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:42:30,679 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-12-14 09:42:30,794 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:42:30,794 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-12-14 09:42:30,831 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-12-14 09:42:30,894 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 09:42:30,894 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 44 treesize of output 37 [2022-12-14 09:42:30,948 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 09:42:30,948 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 39 treesize of output 22 [2022-12-14 09:42:30,952 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-12-14 09:42:31,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:31,031 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-14 09:42:31,031 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 45 treesize of output 43 [2022-12-14 09:42:31,043 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-14 09:42:31,043 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-12-14 09:42:31,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:31,051 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-12-14 09:42:31,131 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-12-14 09:42:31,174 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 09:42:31,174 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 35 treesize of output 18 [2022-12-14 09:42:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:42:31,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:42:31,304 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_500 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_20| Int)) (or (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_20| v_ArrVal_500))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_20| v_ArrVal_501) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse1)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_20|) 0)) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_20| |c_#StackHeapBarrier|)))) is different from false [2022-12-14 09:42:31,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327930393] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:42:31,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1765924217] [2022-12-14 09:42:31,307 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-12-14 09:42:31,307 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:42:31,307 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:42:31,307 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:42:31,307 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:42:31,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:31,326 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:42:31,326 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-12-14 09:42:31,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:31,343 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:42:31,343 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-12-14 09:42:31,362 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-12-14 09:42:31,365 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-12-14 09:42:31,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:31,371 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-12-14 09:42:31,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:31,378 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-12-14 09:42:31,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:31,383 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-12-14 09:42:31,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:31,395 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-12-14 09:42:31,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:31,405 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-12-14 09:42:31,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:31,437 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-12-14 09:42:31,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:31,445 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-12-14 09:42:31,485 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-12-14 09:42:31,491 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-12-14 09:42:31,499 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-12-14 09:42:31,505 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-12-14 09:42:31,510 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-12-14 09:42:31,535 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-12-14 09:42:31,541 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-12-14 09:42:31,547 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-12-14 09:42:31,555 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-12-14 09:42:31,560 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-12-14 09:42:31,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:31,582 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-12-14 09:42:31,588 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-12-14 09:42:31,594 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-12-14 09:42:31,786 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:31,788 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:31,789 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:31,790 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:31,791 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:31,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-12-14 09:42:31,807 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-12-14 09:42:31,813 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-12-14 09:42:31,819 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-12-14 09:42:31,826 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-12-14 09:42:31,947 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:31,950 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:31,951 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:31,952 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:31,953 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:31,962 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-12-14 09:42:31,969 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-12-14 09:42:31,976 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-12-14 09:42:31,985 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-12-14 09:42:31,992 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-12-14 09:42:32,019 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-12-14 09:42:32,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:32,026 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-12-14 09:42:32,036 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-12-14 09:42:32,315 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-12-14 09:42:32,321 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-12-14 09:42:32,326 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-12-14 09:42:32,332 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-12-14 09:42:32,340 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-12-14 09:42:32,349 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:32,350 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:32,352 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:32,353 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:32,354 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:32,487 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:32,488 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:32,489 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:32,490 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:32,491 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:32,498 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-12-14 09:42:32,503 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-12-14 09:42:32,509 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-12-14 09:42:32,517 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-12-14 09:42:32,522 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-12-14 09:42:32,568 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:42:32,569 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-12-14 09:42:32,588 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:42:32,588 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-12-14 09:42:32,600 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-12-14 09:42:32,650 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-12-14 09:42:32,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:32,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:32,662 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:32,663 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-12-14 09:42:32,672 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-12-14 09:42:32,680 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-12-14 09:42:32,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:32,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:32,697 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:32,698 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-12-14 09:42:32,741 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-12-14 09:42:32,748 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-12-14 09:42:32,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:32,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:32,767 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:32,767 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-12-14 09:42:32,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:32,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:32,788 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:32,788 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-12-14 09:42:32,796 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-12-14 09:42:32,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:32,931 INFO L321 Elim1Store]: treesize reduction 60, result has 43.4 percent of original size [2022-12-14 09:42:32,932 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 3 case distinctions, treesize of input 71 treesize of output 49 [2022-12-14 09:42:32,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:32,969 INFO L321 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-12-14 09:42:32,970 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 6 case distinctions, treesize of input 118 treesize of output 44 [2022-12-14 09:42:32,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:33,005 INFO L321 Elim1Store]: treesize reduction 63, result has 27.6 percent of original size [2022-12-14 09:42:33,005 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 6 case distinctions, treesize of input 114 treesize of output 49 [2022-12-14 09:42:33,105 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-12-14 09:42:33,109 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-12-14 09:42:33,119 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-12-14 09:42:33,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:33,125 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-12-14 09:42:33,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:33,129 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-12-14 09:42:33,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:33,136 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-12-14 09:42:33,138 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:42:37,782 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '697#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (< |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 4) (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= |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_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (<= |ULTIMATE.start_sll_circular_prepend_~data#1| 5) (< |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|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (not (= 2 |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (<= 5 |ULTIMATE.start_sll_circular_prepend_~data#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |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) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset|) (not (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (= |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) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (= |#NULL.offset| 0) (<= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset|) (<= 5 |ULTIMATE.start_sll_circular_prepend_#in~data#1|) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (= 1 (select |#valid| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| |ULTIMATE.start_main_~uneq~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 09:42:37,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:42:37,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:42:37,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 33 [2022-12-14 09:42:37,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916095020] [2022-12-14 09:42:37,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:42:37,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 09:42:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:42:37,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 09:42:37,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2465, Unknown=1, NotChecked=100, Total=2756 [2022-12-14 09:42:37,784 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-12-14 09:42:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:42:39,219 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-12-14 09:42:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 09:42:39,220 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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 25 [2022-12-14 09:42:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:42:39,220 INFO L225 Difference]: With dead ends: 48 [2022-12-14 09:42:39,220 INFO L226 Difference]: Without dead ends: 39 [2022-12-14 09:42:39,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=399, Invalid=4026, Unknown=1, NotChecked=130, Total=4556 [2022-12-14 09:42:39,221 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 108 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:42:39,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 248 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 09:42:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-14 09:42:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2022-12-14 09:42:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-12-14 09:42:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-12-14 09:42:39,227 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 25 [2022-12-14 09:42:39,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:42:39,228 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-12-14 09:42:39,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-12-14 09:42:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-12-14 09:42:39,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 09:42:39,229 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:42:39,229 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] [2022-12-14 09:42:39,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 09:42:39,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:42:39,430 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:42:39,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:42:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash 953927736, now seen corresponding path program 1 times [2022-12-14 09:42:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:42:39,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901006220] [2022-12-14 09:42:39,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:39,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:42:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:42:40,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:42:40,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901006220] [2022-12-14 09:42:40,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901006220] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:42:40,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227603363] [2022-12-14 09:42:40,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:40,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:42:40,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:42:40,731 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:42:40,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 09:42:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:40,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 127 conjunts are in the unsatisfiable core [2022-12-14 09:42:40,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:42:40,857 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-12-14 09:42:40,890 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-12-14 09:42:40,930 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)) is different from false [2022-12-14 09:42:40,932 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1)) is different from true [2022-12-14 09:42:40,949 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |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-12-14 09:42:40,951 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |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-12-14 09:42:40,981 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0)))) is different from false [2022-12-14 09:42:40,983 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0)))) is different from true [2022-12-14 09:42:41,003 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-12-14 09:42:41,005 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-12-14 09:42:41,025 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0)))) is different from false [2022-12-14 09:42:41,027 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0)))) is different from true [2022-12-14 09:42:41,075 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |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-12-14 09:42:41,079 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |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-12-14 09:42:41,090 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-12-14 09:42:41,131 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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|)) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_77| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse0 (select |v_#valid_BEFORE_CALL_77| .cse0)))) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse1 (select |v_#valid_BEFORE_CALL_76| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0)))) is different from false [2022-12-14 09:42:41,134 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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|)) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_77| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse0 (select |v_#valid_BEFORE_CALL_77| .cse0)))) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)))) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse1 (select |v_#valid_BEFORE_CALL_76| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0)))) is different from true [2022-12-14 09:42:41,166 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 09:42:41,166 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 53 treesize of output 46 [2022-12-14 09:42:41,209 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_77| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse0 (select |v_#valid_BEFORE_CALL_77| .cse0)))) (= (select |v_#valid_BEFORE_CALL_77| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_77| .cse2) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse2 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse3 (select |v_#valid_BEFORE_CALL_76| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0)))) is different from false [2022-12-14 09:42:41,213 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_77| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse0 (select |v_#valid_BEFORE_CALL_77| .cse0)))) (= (select |v_#valid_BEFORE_CALL_77| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_77| .cse2) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse2 1)))))) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse3 (select |v_#valid_BEFORE_CALL_76| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0)))) is different from true [2022-12-14 09:42:41,225 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-14 09:42:41,225 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 44 treesize of output 19 [2022-12-14 09:42:41,268 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0)))) is different from false [2022-12-14 09:42:41,272 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0)))) is different from true [2022-12-14 09:42:41,326 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0)))) is different from false [2022-12-14 09:42:41,329 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0)))) is different from true [2022-12-14 09:42:41,356 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-12-14 09:42:41,388 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (exists ((v_ArrVal_676 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_676))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (exists ((v_ArrVal_679 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_679)))) is different from false [2022-12-14 09:42:41,392 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (exists ((v_ArrVal_676 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_676))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (exists ((v_ArrVal_679 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_679)))) is different from true [2022-12-14 09:42:41,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:41,463 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-14 09:42:41,464 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 62 treesize of output 60 [2022-12-14 09:42:41,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:41,471 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 41 treesize of output 41 [2022-12-14 09:42:41,547 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_44| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_80| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse4) 0))))) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse5 (select |v_#valid_BEFORE_CALL_76| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from false [2022-12-14 09:42:41,551 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_44| .cse3) 0) (= (select (store |v_#valid_BEFORE_CALL_80| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse4) 0))))) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse5 (select |v_#valid_BEFORE_CALL_76| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from true [2022-12-14 09:42:41,660 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (= (select (store |v_#valid_BEFORE_CALL_80| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_44| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse2) 0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse4 (select |v_#valid_BEFORE_CALL_77| .cse4)))) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse5 (select |v_#valid_BEFORE_CALL_76| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from false [2022-12-14 09:42:41,665 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (= (select (store |v_#valid_BEFORE_CALL_80| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_44| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse2) 0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse4 (select |v_#valid_BEFORE_CALL_77| .cse4)))) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse5 (select |v_#valid_BEFORE_CALL_76| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from true [2022-12-14 09:42:41,782 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (= (select (store |v_#valid_BEFORE_CALL_80| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_44| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse2) 0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse4 (select |v_#valid_BEFORE_CALL_77| .cse4)))) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse5 (select |v_#valid_BEFORE_CALL_76| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from false [2022-12-14 09:42:41,786 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (= (select (store |v_#valid_BEFORE_CALL_80| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_44| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse2) 0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse4 (select |v_#valid_BEFORE_CALL_77| .cse4)))) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse5 (select |v_#valid_BEFORE_CALL_76| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from true [2022-12-14 09:42:42,013 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (= (select (store |v_#valid_BEFORE_CALL_80| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_44| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse2) 0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse4 (select |v_#valid_BEFORE_CALL_77| .cse4)))) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse5 (select |v_#valid_BEFORE_CALL_76| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from false [2022-12-14 09:42:42,018 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (= (select (store |v_#valid_BEFORE_CALL_80| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_44| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse2) 0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse4 (select |v_#valid_BEFORE_CALL_77| .cse4)))) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse5 (select |v_#valid_BEFORE_CALL_76| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from true [2022-12-14 09:42:42,224 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 37 treesize of output 39 [2022-12-14 09:42:42,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:42,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:42,299 INFO L321 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2022-12-14 09:42:42,299 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 3 case distinctions, treesize of input 117 treesize of output 111 [2022-12-14 09:42:42,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:42,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:42,381 INFO L321 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2022-12-14 09:42:42,382 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 98 treesize of output 84 [2022-12-14 09:42:42,397 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 0 case distinctions, treesize of input 69 treesize of output 58 [2022-12-14 09:42:42,430 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 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 09:42:42,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:42,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:42,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:42,437 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 25 treesize of output 29 [2022-12-14 09:42:42,518 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse3))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse1 (select |v_#valid_BEFORE_CALL_76| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse2 (select |v_#valid_BEFORE_CALL_77| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|))) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_224 Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_223) v_arrayElimCell_224))) (and (= (select (store |v_#valid_BEFORE_CALL_80| v_arrayElimCell_223 1) .cse3) 0) (= |v_#valid_BEFORE_CALL_80| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse4 (select |v_#valid_BEFORE_CALL_80| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_44| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimCell_223) 0) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (= (select (select |c_#memory_int| .cse3) 4) |c_ULTIMATE.start_main_~uneq~0#1|)))) is different from false [2022-12-14 09:42:42,523 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ 2 .cse3))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse1 (select |v_#valid_BEFORE_CALL_76| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse2 (select |v_#valid_BEFORE_CALL_77| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|))) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (v_arrayElimCell_223 Int) (v_arrayElimCell_224 Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_223) v_arrayElimCell_224))) (and (= (select (store |v_#valid_BEFORE_CALL_80| v_arrayElimCell_223 1) .cse3) 0) (= |v_#valid_BEFORE_CALL_80| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse4 (select |v_#valid_BEFORE_CALL_80| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_44| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimCell_223) 0) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (= (select (select |c_#memory_int| .cse3) 4) |c_ULTIMATE.start_main_~uneq~0#1|)))) is different from true [2022-12-14 09:42:42,554 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:42:42,555 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 86 treesize of output 54 [2022-12-14 09:42:42,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:42,566 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2022-12-14 09:42:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-12-14 09:42:42,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:42:43,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_683 Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_683)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_684) .cse0 v_ArrVal_682) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_686) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_689) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_685) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_691) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_693) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_690) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-12-14 09:42:43,151 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_683 Int) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_693 (Array Int Int)) (v_ArrVal_685 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_683)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_684) .cse0 v_ArrVal_682) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_686) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_689) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_685) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_691) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_693) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_690) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2022-12-14 09:42:43,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:42:43,430 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 137 [2022-12-14 09:42:43,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:42:43,452 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 1272 treesize of output 1183 [2022-12-14 09:42:43,470 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 542 treesize of output 450 [2022-12-14 09:42:43,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 992 treesize of output 808 [2022-12-14 09:42:46,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227603363] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:42:46,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [525923618] [2022-12-14 09:42:46,551 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-12-14 09:42:46,551 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:42:46,551 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:42:46,551 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:42:46,551 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:42:46,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:46,575 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:42:46,576 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-12-14 09:42:46,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:46,585 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-12-14 09:42:46,602 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-12-14 09:42:46,605 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-12-14 09:42:46,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:46,614 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-12-14 09:42:46,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:46,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-12-14 09:42:46,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:46,624 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-12-14 09:42:46,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:46,639 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-12-14 09:42:46,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:46,647 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-12-14 09:42:46,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:46,675 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-12-14 09:42:46,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:46,684 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-12-14 09:42:46,736 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-12-14 09:42:46,743 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-12-14 09:42:46,750 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-12-14 09:42:46,760 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-12-14 09:42:46,768 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-12-14 09:42:46,802 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-12-14 09:42:46,810 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-12-14 09:42:46,819 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-12-14 09:42:46,827 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-12-14 09:42:46,833 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-12-14 09:42:46,855 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-12-14 09:42:46,866 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-12-14 09:42:46,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:46,875 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-12-14 09:42:47,054 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,055 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,056 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,057 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,058 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,068 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-12-14 09:42:47,076 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-12-14 09:42:47,084 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-12-14 09:42:47,093 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-12-14 09:42:47,106 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-12-14 09:42:47,263 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,264 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,265 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,267 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,268 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,278 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-12-14 09:42:47,286 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-12-14 09:42:47,294 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-12-14 09:42:47,302 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-12-14 09:42:47,312 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-12-14 09:42:47,342 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-12-14 09:42:47,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:47,351 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-12-14 09:42:47,363 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-12-14 09:42:47,611 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-12-14 09:42:47,618 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-12-14 09:42:47,626 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-12-14 09:42:47,634 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-12-14 09:42:47,645 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-12-14 09:42:47,656 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,658 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,659 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,660 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,661 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,783 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-12-14 09:42:47,789 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-12-14 09:42:47,795 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-12-14 09:42:47,801 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-12-14 09:42:47,810 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-12-14 09:42:47,819 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,820 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,821 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,822 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,823 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:47,869 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:42:47,870 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-12-14 09:42:47,894 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:42:47,895 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-12-14 09:42:47,906 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-12-14 09:42:47,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:47,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:47,963 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:47,963 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-12-14 09:42:47,971 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-12-14 09:42:47,981 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-12-14 09:42:47,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:47,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:47,998 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:47,998 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-12-14 09:42:48,006 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-12-14 09:42:48,044 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-12-14 09:42:48,053 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-12-14 09:42:48,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:48,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:48,069 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:48,070 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-12-14 09:42:48,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:48,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:48,088 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:48,089 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-12-14 09:42:48,099 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-12-14 09:42:48,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:48,331 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:42:48,331 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:42:48,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:48,377 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:42:48,377 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:42:48,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:42:48,428 INFO L321 Elim1Store]: treesize reduction 59, result has 36.6 percent of original size [2022-12-14 09:42:48,428 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 2 case distinctions, treesize of input 63 treesize of output 34 [2022-12-14 09:42:48,482 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-12-14 09:42:48,487 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-12-14 09:42:48,490 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-12-14 09:42:48,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:48,502 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-12-14 09:42:48,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:48,508 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-12-14 09:42:48,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:48,514 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-12-14 09:42:48,516 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:42:52,542 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1002#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (<= 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|)) (= (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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_prepend_~data#1| 5) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= 5 |ULTIMATE.start_sll_circular_prepend_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset|) (not (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_prepend_#in~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 09:42:52,542 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:42:52,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:42:52,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 38 [2022-12-14 09:42:52,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751696270] [2022-12-14 09:42:52,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:42:52,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 09:42:52,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:42:52,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 09:42:52,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1745, Unknown=69, NotChecked=1818, Total=3782 [2022-12-14 09:42:52,544 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 39 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 28 states have internal predecessors, (38), 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-12-14 09:42:52,801 WARN L837 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#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-12-14 09:42:52,803 WARN L859 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#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-12-14 09:42:52,806 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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-12-14 09:42:52,809 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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-12-14 09:42:52,815 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse1 (select |v_#valid_BEFORE_CALL_76| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0))) is different from false [2022-12-14 09:42:52,818 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_node_create_~temp~0#1.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| .cse0)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse1 (select |v_#valid_BEFORE_CALL_76| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= .cse0 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0))) is different from true [2022-12-14 09:42:52,825 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1))))) is different from false [2022-12-14 09:42:52,829 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= |c_#valid| (let ((.cse1 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse1 (select |c_#valid| .cse1))))) is different from true [2022-12-14 09:42:52,846 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= (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|)) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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-12-14 09:42:52,849 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= (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|)) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |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-12-14 09:42:52,861 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (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|))) (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|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse2 (select |v_#valid_BEFORE_CALL_76| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-12-14 09:42:52,865 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (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|))) (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|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)))) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse2 (select |v_#valid_BEFORE_CALL_76| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-12-14 09:42:52,881 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_#valid_BEFORE_CALL_77| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_42| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_77| .cse2) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse2 1)))) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse3 (select |v_#valid_BEFORE_CALL_76| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= (select |c_#valid| .cse2) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-12-14 09:42:52,885 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_#valid_BEFORE_CALL_77| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_42| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_77| .cse2) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_77| .cse2 1)))) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse3 (select |v_#valid_BEFORE_CALL_76| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= (select |c_#valid| .cse2) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-12-14 09:42:52,905 WARN L837 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0)))) is different from false [2022-12-14 09:42:52,909 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |v_#valid_BEFORE_CALL_76| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0)))) is different from true [2022-12-14 09:42:52,922 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse3 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse0 (select |c_#memory_int| |c_node_create_#res#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select .cse0 (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse2 (= (select |c_old(#valid)| .cse3) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse3 (select |c_#memory_$Pointer$.base| .cse3))) (or .cse2 (<= (+ .cse3 1) |c_#StackHeapBarrier|)) (= (select .cse0 4) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse4 (select |v_#valid_BEFORE_CALL_76| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_676 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_676))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse5 (select |v_#valid_BEFORE_CALL_77| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (exists ((v_ArrVal_679 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_679))))) is different from false [2022-12-14 09:42:52,927 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse3 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse0 (select |c_#memory_int| |c_node_create_#res#1.base|))) (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= |c_node_create_#in~data#1| (select .cse0 (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (or (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse2 (= (select |c_old(#valid)| .cse3) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse3 (select |c_#memory_$Pointer$.base| .cse3))) (or .cse2 (<= (+ .cse3 1) |c_#StackHeapBarrier|)) (= (select .cse0 4) |c_node_create_#in~data#1|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse4 (select |v_#valid_BEFORE_CALL_76| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_676 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_676))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse5 (select |v_#valid_BEFORE_CALL_77| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (exists ((v_ArrVal_679 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_679))))) is different from true [2022-12-14 09:42:52,973 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (.cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= (select .cse0 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse2 (select |v_#valid_BEFORE_CALL_77| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (<= .cse1 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse3 (select |v_#valid_BEFORE_CALL_80| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_44| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_80| .cse5 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse5) 0))))) (not (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse6)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse7 (select |v_#valid_BEFORE_CALL_76| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from false [2022-12-14 09:42:52,979 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (.cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= (select .cse0 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse2 (select |v_#valid_BEFORE_CALL_77| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (<= .cse1 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse3 (select |v_#valid_BEFORE_CALL_80| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_44| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_80| .cse5 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse5) 0))))) (not (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse6)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse7 (select |v_#valid_BEFORE_CALL_76| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from true [2022-12-14 09:42:53,027 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (= (select (store |v_#valid_BEFORE_CALL_80| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_44| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse6 (select |v_#valid_BEFORE_CALL_77| .cse6)))) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse7 (select |v_#valid_BEFORE_CALL_76| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from false [2022-12-14 09:42:53,032 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (= (select (store |v_#valid_BEFORE_CALL_80| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_44| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse6 (select |v_#valid_BEFORE_CALL_77| .cse6)))) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (not (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse7 (select |v_#valid_BEFORE_CALL_76| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from true [2022-12-14 09:42:53,095 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (= (select (store |v_#valid_BEFORE_CALL_80| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_44| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 0))))) (not (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse6 (select |v_#valid_BEFORE_CALL_77| .cse6)))) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse7 (select |v_#valid_BEFORE_CALL_76| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from false [2022-12-14 09:42:53,101 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (= (select (store |v_#valid_BEFORE_CALL_80| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_44| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 0))))) (not (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse6 (select |v_#valid_BEFORE_CALL_77| .cse6)))) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse7 (select |v_#valid_BEFORE_CALL_76| .cse7)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from true [2022-12-14 09:42:53,156 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (= (select (store |v_#valid_BEFORE_CALL_80| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_44| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 0))))) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse5 (select |v_#valid_BEFORE_CALL_77| .cse5)))) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse6 (select |v_#valid_BEFORE_CALL_76| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from false [2022-12-14 09:42:53,162 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (= (select (store |v_#valid_BEFORE_CALL_80| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_44| .cse4) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_80| .cse3) 0))))) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int)) (v_arrayElimCell_214 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13| Int)) (and (= |v_#valid_BEFORE_CALL_77| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse5 (select |v_#valid_BEFORE_CALL_77| .cse5)))) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_214) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimCell_214) 1) (= (select |v_#valid_BEFORE_CALL_77| v_arrayElimIndex_6) 0))) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse6 (select |v_#valid_BEFORE_CALL_76| .cse6)))) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0))))) is different from true [2022-12-14 09:42:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:42:53,284 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-12-14 09:42:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 09:42:53,284 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 28 states have internal predecessors, (38), 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 27 [2022-12-14 09:42:53,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:42:53,285 INFO L225 Difference]: With dead ends: 47 [2022-12-14 09:42:53,285 INFO L226 Difference]: Without dead ends: 45 [2022-12-14 09:42:53,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 31 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=188, Invalid=1911, Unknown=95, NotChecked=3658, Total=5852 [2022-12-14 09:42:53,286 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:42:53,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 176 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 389 Unchecked, 0.2s Time] [2022-12-14 09:42:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-12-14 09:42:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-12-14 09:42:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 09:42:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-12-14 09:42:53,296 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 27 [2022-12-14 09:42:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:42:53,296 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-12-14 09:42:53,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 28 states have internal predecessors, (38), 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-12-14 09:42:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-12-14 09:42:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 09:42:53,297 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:42:53,297 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] [2022-12-14 09:42:53,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-14 09:42:53,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:42:53,498 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:42:53,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:42:53,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1896541299, now seen corresponding path program 1 times [2022-12-14 09:42:53,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:42:53,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033038583] [2022-12-14 09:42:53,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:53,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:42:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:42:56,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:42:56,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033038583] [2022-12-14 09:42:56,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033038583] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:42:56,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813156566] [2022-12-14 09:42:56,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:42:56,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:42:56,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:42:56,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:42:56,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 09:42:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:42:56,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 147 conjunts are in the unsatisfiable core [2022-12-14 09:42:56,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:42:56,425 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-12-14 09:42:56,603 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-12-14 09:42:56,662 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-12-14 09:42:56,740 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:42:56,740 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-12-14 09:42:56,845 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-12-14 09:42:56,861 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-12-14 09:42:56,954 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 09:42:56,954 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 69 treesize of output 50 [2022-12-14 09:42:56,964 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-12-14 09:42:57,068 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:42:57,069 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 68 treesize of output 31 [2022-12-14 09:42:57,073 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-12-14 09:42:57,078 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-12-14 09:42:57,082 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-12-14 09:42:57,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:57,261 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-12-14 09:42:57,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:57,279 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-14 09:42:57,280 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 78 treesize of output 66 [2022-12-14 09:42:57,305 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-14 09:42:57,305 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-12-14 09:42:57,316 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 18 treesize of output 20 [2022-12-14 09:42:57,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:57,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:57,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:57,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:57,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:57,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2022-12-14 09:42:57,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:57,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:57,962 INFO L321 Elim1Store]: treesize reduction 36, result has 12.2 percent of original size [2022-12-14 09:42:57,962 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 3 case distinctions, treesize of input 149 treesize of output 122 [2022-12-14 09:42:57,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:57,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:57,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2022-12-14 09:42:57,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:57,990 INFO L321 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2022-12-14 09:42:57,990 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 3 case distinctions, treesize of input 134 treesize of output 107 [2022-12-14 09:42:57,997 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 0 case distinctions, treesize of input 114 treesize of output 93 [2022-12-14 09:42:58,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:58,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2022-12-14 09:42:58,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:58,039 INFO L321 Elim1Store]: treesize reduction 58, result has 21.6 percent of original size [2022-12-14 09:42:58,039 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 97 treesize of output 95 [2022-12-14 09:42:58,049 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 0 case distinctions, treesize of input 40 treesize of output 33 [2022-12-14 09:42:58,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:58,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:58,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2022-12-14 09:42:58,060 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 16 treesize of output 15 [2022-12-14 09:42:58,068 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 16 treesize of output 15 [2022-12-14 09:42:58,365 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-12-14 09:42:58,365 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 188 treesize of output 66 [2022-12-14 09:42:58,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:58,373 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-12-14 09:42:58,438 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-12-14 09:42:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:42:58,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:42:58,696 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_900 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_891 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_891) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_894)) (.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_899) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_896))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_887) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_898) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_900) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2022-12-14 09:42:58,729 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_900 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_891 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_891) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_894)) (.cse1 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_899) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_896))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_887) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_898) .cse0 v_ArrVal_900) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))))) is different from false [2022-12-14 09:42:58,753 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_900 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_891 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_891) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_894)) (.cse1 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse5)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_899) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) .cse0 v_ArrVal_896))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_887) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_898) .cse0 v_ArrVal_900) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))))) is different from false [2022-12-14 09:42:58,770 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_900 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_891 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_891) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_894)) (.cse1 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse5)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_899) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) .cse0 v_ArrVal_896))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_887) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_898) .cse0 v_ArrVal_900) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))))) is different from false [2022-12-14 09:42:58,861 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_898 (Array Int Int)) (v_ArrVal_900 (Array Int Int)) (v_ArrVal_910 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_28| Int) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_891 (Array Int Int)) (v_ArrVal_894 (Array Int Int)) (v_ArrVal_909 (Array Int Int)) (v_ArrVal_896 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_28| v_ArrVal_910))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_28| v_ArrVal_909) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select .cse7 .cse5) .cse6))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_28| (store v_ArrVal_909 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_28| v_ArrVal_891) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_894)) (.cse1 (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_28| (store v_ArrVal_910 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse5)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_28| v_ArrVal_899) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_28|)) .cse0 v_ArrVal_896))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_28| v_ArrVal_887) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_898) .cse0 v_ArrVal_900) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_28|) 0)) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_28| |c_#StackHeapBarrier|)))) is different from false [2022-12-14 09:42:58,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813156566] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:42:58,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [948484938] [2022-12-14 09:42:58,865 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-12-14 09:42:58,865 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:42:58,865 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:42:58,865 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:42:58,865 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:42:58,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:58,889 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:42:58,889 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-12-14 09:42:58,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:58,898 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-12-14 09:42:58,924 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-12-14 09:42:58,927 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-12-14 09:42:58,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:58,935 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-12-14 09:42:58,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:58,939 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-12-14 09:42:58,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:58,947 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-12-14 09:42:58,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:58,963 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-12-14 09:42:58,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:58,971 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-12-14 09:42:58,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:59,000 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-12-14 09:42:59,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:59,007 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-12-14 09:42:59,053 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-12-14 09:42:59,061 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-12-14 09:42:59,068 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-12-14 09:42:59,078 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-12-14 09:42:59,086 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-12-14 09:42:59,111 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-12-14 09:42:59,119 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-12-14 09:42:59,128 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-12-14 09:42:59,137 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-12-14 09:42:59,143 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-12-14 09:42:59,165 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-12-14 09:42:59,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:59,174 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-12-14 09:42:59,186 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-12-14 09:42:59,351 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,352 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,353 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,354 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,356 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,365 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-12-14 09:42:59,373 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-12-14 09:42:59,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-12-14 09:42:59,391 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-12-14 09:42:59,398 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-12-14 09:42:59,489 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,490 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,491 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,493 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,494 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,503 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-12-14 09:42:59,511 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-12-14 09:42:59,519 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-12-14 09:42:59,528 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-12-14 09:42:59,536 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-12-14 09:42:59,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:42:59,568 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-12-14 09:42:59,576 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-12-14 09:42:59,584 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-12-14 09:42:59,852 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,854 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,855 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,856 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,857 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:42:59,866 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-12-14 09:42:59,874 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-12-14 09:42:59,881 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-12-14 09:42:59,889 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-12-14 09:42:59,897 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-12-14 09:43:00,058 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:00,059 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:00,060 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:00,061 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:00,062 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:00,070 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-12-14 09:43:00,077 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-12-14 09:43:00,085 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-12-14 09:43:00,091 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-12-14 09:43:00,097 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-12-14 09:43:00,148 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:43:00,148 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-12-14 09:43:00,168 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:43:00,168 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-12-14 09:43:00,179 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-12-14 09:43:00,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-12-14 09:43:00,239 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-12-14 09:43:00,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:00,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:00,253 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:00,253 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-12-14 09:43:00,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:00,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:00,269 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:00,270 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-12-14 09:43:00,278 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-12-14 09:43:00,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:00,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:00,334 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:00,334 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-12-14 09:43:00,344 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-12-14 09:43:00,351 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-12-14 09:43:00,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:00,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:00,368 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:00,368 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-12-14 09:43:00,375 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-12-14 09:43:00,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:00,598 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:43:00,598 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:43:00,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:00,640 INFO L321 Elim1Store]: treesize reduction 59, result has 36.6 percent of original size [2022-12-14 09:43:00,641 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 2 case distinctions, treesize of input 63 treesize of output 34 [2022-12-14 09:43:00,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:00,678 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:43:00,678 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:43:00,734 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-12-14 09:43:00,739 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-12-14 09:43:00,742 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-12-14 09:43:00,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:00,748 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-12-14 09:43:00,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:00,756 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-12-14 09:43:00,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:00,762 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-12-14 09:43:00,763 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:43:06,083 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1355#(and (= (select (select |#memory_$Pointer$.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.base|) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| (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|) 4))) (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_prepend_~new_head~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_prepend_~data#1| 5) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= 5 |ULTIMATE.start_sll_circular_prepend_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset|) (= (select (select |#memory_$Pointer$.offset| (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_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_prepend_#in~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 09:43:06,084 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:43:06,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:43:06,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2022-12-14 09:43:06,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662399621] [2022-12-14 09:43:06,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:43:06,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 09:43:06,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:43:06,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 09:43:06,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=4227, Unknown=7, NotChecked=670, Total=5112 [2022-12-14 09:43:06,086 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 44 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 09:43:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:43:10,200 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-12-14 09:43:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 09:43:10,200 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 6 states have call successors, (6), 3 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 29 [2022-12-14 09:43:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:43:10,201 INFO L225 Difference]: With dead ends: 60 [2022-12-14 09:43:10,201 INFO L226 Difference]: Without dead ends: 58 [2022-12-14 09:43:10,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=378, Invalid=6441, Unknown=7, NotChecked=830, Total=7656 [2022-12-14 09:43:10,202 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 156 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:43:10,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 301 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 09:43:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-14 09:43:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2022-12-14 09:43:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 09:43:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-12-14 09:43:10,214 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 29 [2022-12-14 09:43:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:43:10,214 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-12-14 09:43:10,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 09:43:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-12-14 09:43:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 09:43:10,215 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:43:10,215 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] [2022-12-14 09:43:10,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 09:43:10,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:43:10,416 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:43:10,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:43:10,416 INFO L85 PathProgramCache]: Analyzing trace with hash -888686627, now seen corresponding path program 2 times [2022-12-14 09:43:10,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:43:10,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943451292] [2022-12-14 09:43:10,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:43:10,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:43:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:43:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:43:11,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:43:11,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943451292] [2022-12-14 09:43:11,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943451292] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:43:11,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650631141] [2022-12-14 09:43:11,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 09:43:11,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:43:11,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:43:11,257 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:43:11,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 09:43:11,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 09:43:11,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:43:11,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-14 09:43:11,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:43:11,477 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-12-14 09:43:11,641 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:43:11,642 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-12-14 09:43:11,699 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-12-14 09:43:11,706 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-12-14 09:43:11,768 INFO L321 Elim1Store]: treesize reduction 37, result has 28.8 percent of original size [2022-12-14 09:43:11,768 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 140 treesize of output 82 [2022-12-14 09:43:11,775 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 102 treesize of output 68 [2022-12-14 09:43:11,830 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-12-14 09:43:11,830 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 50 [2022-12-14 09:43:11,836 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:11,836 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 13 [2022-12-14 09:43:11,864 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_1090 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1090) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1089 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1089) |c_#memory_$Pointer$.base|)))) is different from true [2022-12-14 09:43:11,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:11,891 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-14 09:43:11,891 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 114 treesize of output 102 [2022-12-14 09:43:11,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:11,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:11,907 INFO L321 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-12-14 09:43:11,907 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 111 [2022-12-14 09:43:11,940 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-12-14 09:43:11,940 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-12-14 09:43:12,139 INFO L321 Elim1Store]: treesize reduction 74, result has 3.9 percent of original size [2022-12-14 09:43:12,139 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 151 treesize of output 83 [2022-12-14 09:43:12,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 09:43:12,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:43:12,416 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_26| Int) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (or (not (< |v_node_create_~temp~0#1.base_26| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_26|) 0)) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_26| v_ArrVal_1097))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_26| v_ArrVal_1096))) (let ((.cse5 (select (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (select (select .cse3 .cse4) .cse5))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) .cse4)))))) is different from false [2022-12-14 09:43:12,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650631141] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:43:12,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [419877940] [2022-12-14 09:43:12,419 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-12-14 09:43:12,419 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:43:12,419 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:43:12,419 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:43:12,419 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:43:12,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:12,438 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:43:12,438 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-12-14 09:43:12,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:12,453 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:43:12,453 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-12-14 09:43:12,467 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-12-14 09:43:12,469 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-12-14 09:43:12,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:12,475 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-12-14 09:43:12,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:12,484 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-12-14 09:43:12,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:12,489 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-12-14 09:43:12,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:12,504 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-12-14 09:43:12,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:12,511 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-12-14 09:43:12,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:12,535 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-12-14 09:43:12,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:12,544 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-12-14 09:43:12,585 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-12-14 09:43:12,591 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-12-14 09:43:12,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-12-14 09:43:12,603 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-12-14 09:43:12,613 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-12-14 09:43:12,639 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-12-14 09:43:12,648 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-12-14 09:43:12,656 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-12-14 09:43:12,662 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-12-14 09:43:12,667 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-12-14 09:43:12,697 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-12-14 09:43:12,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:12,707 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-12-14 09:43:12,713 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-12-14 09:43:12,757 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-12-14 09:43:12,763 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-12-14 09:43:12,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-12-14 09:43:12,775 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-12-14 09:43:12,783 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-12-14 09:43:12,807 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-12-14 09:43:12,813 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-12-14 09:43:12,820 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-12-14 09:43:12,826 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-12-14 09:43:12,832 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-12-14 09:43:12,854 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-12-14 09:43:12,860 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-12-14 09:43:12,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:12,868 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-12-14 09:43:12,915 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-12-14 09:43:12,921 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-12-14 09:43:12,928 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-12-14 09:43:12,935 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-12-14 09:43:12,941 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-12-14 09:43:12,968 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-12-14 09:43:12,974 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-12-14 09:43:12,982 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-12-14 09:43:12,990 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-12-14 09:43:12,996 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-12-14 09:43:13,045 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:43:13,045 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-12-14 09:43:13,067 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:43:13,067 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-12-14 09:43:13,085 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-12-14 09:43:13,139 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-12-14 09:43:13,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:13,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:13,158 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:13,158 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-12-14 09:43:13,170 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-12-14 09:43:13,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:13,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:13,187 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:13,187 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-12-14 09:43:13,197 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-12-14 09:43:13,243 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-12-14 09:43:13,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:13,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:13,262 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:13,262 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-12-14 09:43:13,271 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-12-14 09:43:13,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:13,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:13,288 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:13,288 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-12-14 09:43:13,298 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-12-14 09:43:13,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:13,450 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:43:13,450 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:43:13,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:13,500 INFO L321 Elim1Store]: treesize reduction 59, result has 36.6 percent of original size [2022-12-14 09:43:13,501 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 2 case distinctions, treesize of input 63 treesize of output 34 [2022-12-14 09:43:13,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:13,541 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:43:13,542 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:43:13,596 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-12-14 09:43:13,601 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-12-14 09:43:13,605 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-12-14 09:43:13,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:13,615 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-12-14 09:43:13,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:13,620 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-12-14 09:43:13,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:13,625 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-12-14 09:43:13,625 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:43:17,018 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1719#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (<= 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|)) (= (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) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_prepend_~data#1| 5) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= 5 |ULTIMATE.start_sll_circular_prepend_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset|) (not (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_prepend_#in~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 09:43:17,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:43:17,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:43:17,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 36 [2022-12-14 09:43:17,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002856827] [2022-12-14 09:43:17,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:43:17,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 09:43:17,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:43:17,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 09:43:17,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2988, Unknown=2, NotChecked=222, Total=3422 [2022-12-14 09:43:17,020 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 36 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 29 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 09:43:18,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:43:18,444 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-12-14 09:43:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 09:43:18,445 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 29 states have internal predecessors, (41), 6 states have call successors, (6), 3 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 29 [2022-12-14 09:43:18,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:43:18,445 INFO L225 Difference]: With dead ends: 66 [2022-12-14 09:43:18,445 INFO L226 Difference]: Without dead ends: 55 [2022-12-14 09:43:18,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=316, Invalid=3850, Unknown=2, NotChecked=254, Total=4422 [2022-12-14 09:43:18,446 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 09:43:18,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 257 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 581 Invalid, 0 Unknown, 47 Unchecked, 0.6s Time] [2022-12-14 09:43:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-14 09:43:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-12-14 09:43:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 09:43:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-12-14 09:43:18,458 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 29 [2022-12-14 09:43:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:43:18,458 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-12-14 09:43:18,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 29 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 09:43:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-12-14 09:43:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 09:43:18,459 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:43:18,459 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, 1] [2022-12-14 09:43:18,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 09:43:18,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:43:18,661 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:43:18,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:43:18,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1511992585, now seen corresponding path program 1 times [2022-12-14 09:43:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:43:18,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761566368] [2022-12-14 09:43:18,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:43:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:43:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:43:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:43:21,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:43:21,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761566368] [2022-12-14 09:43:21,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761566368] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:43:21,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806470562] [2022-12-14 09:43:21,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:43:21,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:43:21,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:43:21,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:43:21,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 09:43:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:43:21,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 158 conjunts are in the unsatisfiable core [2022-12-14 09:43:21,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:43:21,164 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-12-14 09:43:21,451 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 25 treesize of output 13 [2022-12-14 09:43:21,454 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-12-14 09:43:21,457 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-12-14 09:43:21,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:21,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:21,573 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 43 treesize of output 38 [2022-12-14 09:43:21,590 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-14 09:43:21,590 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 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-14 09:43:21,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:21,599 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 14 treesize of output 16 [2022-12-14 09:43:22,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:22,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:22,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:22,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 232 [2022-12-14 09:43:22,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:22,499 INFO L321 Elim1Store]: treesize reduction 203, result has 11.4 percent of original size [2022-12-14 09:43:22,500 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 10 case distinctions, treesize of input 283 treesize of output 125 [2022-12-14 09:43:22,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:22,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:22,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 153 [2022-12-14 09:43:22,516 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 0 case distinctions, treesize of input 167 treesize of output 146 [2022-12-14 09:43:22,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:22,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:22,571 INFO L321 Elim1Store]: treesize reduction 105, result has 60.4 percent of original size [2022-12-14 09:43:22,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 143 treesize of output 249 [2022-12-14 09:43:22,577 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2022-12-14 09:43:22,675 INFO L321 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2022-12-14 09:43:22,675 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 94 treesize of output 1 [2022-12-14 09:43:22,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:22,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 98 [2022-12-14 09:43:22,720 INFO L321 Elim1Store]: treesize reduction 37, result has 48.6 percent of original size [2022-12-14 09:43:22,721 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 79 treesize of output 111 [2022-12-14 09:43:23,260 INFO L321 Elim1Store]: treesize reduction 131, result has 18.1 percent of original size [2022-12-14 09:43:23,260 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 12 new quantified variables, introduced 15 case distinctions, treesize of input 197 treesize of output 119 [2022-12-14 09:43:23,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:23,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:23,284 INFO L321 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2022-12-14 09:43:23,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 49 [2022-12-14 09:43:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:43:23,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:43:27,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806470562] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:43:27,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2129060193] [2022-12-14 09:43:27,995 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-12-14 09:43:27,995 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:43:27,995 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:43:27,995 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:43:27,995 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:43:28,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:28,017 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:43:28,017 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-12-14 09:43:28,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:28,027 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-12-14 09:43:28,045 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-12-14 09:43:28,047 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-12-14 09:43:28,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:28,054 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-12-14 09:43:28,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:28,058 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-12-14 09:43:28,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:28,065 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-12-14 09:43:28,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:28,078 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-12-14 09:43:28,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:28,085 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-12-14 09:43:28,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:28,105 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-12-14 09:43:28,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:28,112 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-12-14 09:43:28,270 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-12-14 09:43:28,276 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-12-14 09:43:28,281 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-12-14 09:43:28,288 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-12-14 09:43:28,294 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-12-14 09:43:28,304 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:28,305 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:28,306 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:28,308 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:28,309 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:28,420 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-12-14 09:43:28,428 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-12-14 09:43:28,436 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-12-14 09:43:28,443 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-12-14 09:43:28,451 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-12-14 09:43:28,462 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:28,463 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:28,464 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:28,465 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:28,466 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:28,499 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-12-14 09:43:28,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:28,508 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-12-14 09:43:28,519 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-12-14 09:43:28,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:28,623 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 144 treesize of output 126 [2022-12-14 09:43:28,632 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 140 treesize of output 128 [2022-12-14 09:43:28,639 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-12-14 09:43:28,742 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-12-14 09:43:28,749 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-12-14 09:43:28,760 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-12-14 09:43:28,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:28,841 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:28,841 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-12-14 09:43:28,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:28,863 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:28,863 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-12-14 09:43:28,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:28,939 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:28,939 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-12-14 09:43:28,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:28,954 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:28,954 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-12-14 09:43:29,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:29,142 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:43:29,142 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:43:29,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:29,175 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:43:29,175 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:43:29,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:29,222 INFO L321 Elim1Store]: treesize reduction 59, result has 36.6 percent of original size [2022-12-14 09:43:29,222 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 2 case distinctions, treesize of input 63 treesize of output 34 [2022-12-14 09:43:29,318 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-12-14 09:43:29,324 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-12-14 09:43:29,328 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-12-14 09:43:29,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:29,339 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-12-14 09:43:29,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:29,346 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-12-14 09:43:29,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:29,353 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-12-14 09:43:29,356 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:43:35,782 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2089#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| (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|) 4))) (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (<= |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_main_~uneq~0#1| 5) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.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|))) (+ (select (select |#memory_$Pointer$.offset| (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|)) 4))) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_prepend_~data#1| 5) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.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|))) (select (select |#memory_$Pointer$.offset| (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_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.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|))) (select (select |#memory_$Pointer$.offset| (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|)))) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= 5 |ULTIMATE.start_sll_circular_prepend_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_main_~count~0#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_prepend_#in~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 09:43:35,782 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:43:35,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:43:35,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 39 [2022-12-14 09:43:35,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322795601] [2022-12-14 09:43:35,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:43:35,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 09:43:35,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:43:35,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 09:43:35,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4163, Unknown=0, NotChecked=0, Total=4422 [2022-12-14 09:43:35,784 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-14 09:43:39,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:43:39,281 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2022-12-14 09:43:39,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 09:43:39,281 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2022-12-14 09:43:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:43:39,282 INFO L225 Difference]: With dead ends: 79 [2022-12-14 09:43:39,282 INFO L226 Difference]: Without dead ends: 76 [2022-12-14 09:43:39,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1889 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=416, Invalid=6724, Unknown=0, NotChecked=0, Total=7140 [2022-12-14 09:43:39,285 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 90 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 09:43:39,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 362 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 09:43:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-14 09:43:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2022-12-14 09:43:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 52 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 09:43:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2022-12-14 09:43:39,310 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 31 [2022-12-14 09:43:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:43:39,311 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2022-12-14 09:43:39,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-14 09:43:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-12-14 09:43:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 09:43:39,312 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:43:39,312 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:43:39,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 09:43:39,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:43:39,513 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:43:39,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:43:39,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1267944004, now seen corresponding path program 3 times [2022-12-14 09:43:39,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:43:39,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704464696] [2022-12-14 09:43:39,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:43:39,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:43:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:43:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 09:43:39,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:43:39,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704464696] [2022-12-14 09:43:39,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704464696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:43:39,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215750458] [2022-12-14 09:43:39,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 09:43:39,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:43:39,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:43:39,628 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:43:39,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 09:43:40,136 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 09:43:40,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:43:40,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 09:43:40,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:43:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 09:43:40,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:43:40,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215750458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:43:40,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:43:40,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-14 09:43:40,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016052090] [2022-12-14 09:43:40,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:43:40,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:43:40,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:43:40,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:43:40,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:43:40,154 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 09:43:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:43:40,192 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-12-14 09:43:40,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:43:40,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-12-14 09:43:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:43:40,193 INFO L225 Difference]: With dead ends: 77 [2022-12-14 09:43:40,193 INFO L226 Difference]: Without dead ends: 41 [2022-12-14 09:43:40,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:43:40,194 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:43:40,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:43:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-14 09:43:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-12-14 09:43:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:43:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-12-14 09:43:40,205 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 33 [2022-12-14 09:43:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:43:40,205 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-12-14 09:43:40,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-14 09:43:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-12-14 09:43:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 09:43:40,206 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:43:40,206 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-12-14 09:43:40,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 09:43:40,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-14 09:43:40,408 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:43:40,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:43:40,409 INFO L85 PathProgramCache]: Analyzing trace with hash -372828951, now seen corresponding path program 1 times [2022-12-14 09:43:40,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:43:40,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667462738] [2022-12-14 09:43:40,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:43:40,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:43:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:43:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:43:43,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:43:43,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667462738] [2022-12-14 09:43:43,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667462738] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:43:43,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715678763] [2022-12-14 09:43:43,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:43:43,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:43:43,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:43:43,735 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:43:43,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 09:43:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:43:43,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 180 conjunts are in the unsatisfiable core [2022-12-14 09:43:43,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:43:43,882 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-12-14 09:43:43,889 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-12-14 09:43:43,948 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-12-14 09:43:44,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:44,007 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 14 [2022-12-14 09:43:44,201 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-12-14 09:43:44,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:44,204 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-12-14 09:43:44,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:44,347 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 09:43:44,347 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-12-14 09:43:44,366 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 21 treesize of output 21 [2022-12-14 09:43:44,457 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 21 treesize of output 21 [2022-12-14 09:43:44,470 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-12-14 09:43:44,479 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-12-14 09:43:44,580 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-14 09:43:44,580 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 162 treesize of output 119 [2022-12-14 09:43:44,588 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 34 treesize of output 36 [2022-12-14 09:43:44,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:44,598 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 74 treesize of output 45 [2022-12-14 09:43:44,763 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-14 09:43:44,764 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 123 treesize of output 50 [2022-12-14 09:43:44,769 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 09:43:44,774 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-12-14 09:43:44,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:44,778 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-12-14 09:43:44,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:44,932 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-14 09:43:44,932 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 131 treesize of output 107 [2022-12-14 09:43:44,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:44,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:44,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 109 [2022-12-14 09:43:44,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:44,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:44,959 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-12-14 09:43:44,959 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 37 treesize of output 37 [2022-12-14 09:43:44,967 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 45 treesize of output 33 [2022-12-14 09:43:45,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:45,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:45,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:45,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:45,713 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 92 treesize of output 53 [2022-12-14 09:43:45,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:45,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:45,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 171 [2022-12-14 09:43:45,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:45,743 INFO L321 Elim1Store]: treesize reduction 99, result has 10.0 percent of original size [2022-12-14 09:43:45,744 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 193 treesize of output 97 [2022-12-14 09:43:45,774 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-12-14 09:43:45,774 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 238 treesize of output 167 [2022-12-14 09:43:45,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:45,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 159 [2022-12-14 09:43:45,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:45,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:45,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2022-12-14 09:43:45,796 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 0 case distinctions, treesize of input 143 treesize of output 128 [2022-12-14 09:43:45,804 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 43 treesize of output 57 [2022-12-14 09:43:45,810 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 12 treesize of output 11 [2022-12-14 09:43:46,322 INFO L321 Elim1Store]: treesize reduction 105, result has 6.3 percent of original size [2022-12-14 09:43:46,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 262 treesize of output 103 [2022-12-14 09:43:46,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:46,338 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-12-14 09:43:46,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 25 [2022-12-14 09:43:46,389 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-12-14 09:43:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:43:46,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:43:46,689 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1706 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1708) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1709)) (.cse1 (store (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_1706))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (select (select .cse4 .cse5) .cse6))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1703) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1700))) (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| v_ArrVal_1715))) (select (select .cse1 .cse2) .cse3)) (+ 4 (select (select .cse4 .cse2) .cse3)))))))) is different from false [2022-12-14 09:43:46,756 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1706 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1708) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse1 v_ArrVal_1709)) (.cse2 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse1 v_ArrVal_1706))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (select (select .cse5 .cse6) .cse7))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1703) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1700))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_1715))) (select (select .cse2 .cse3) .cse4)) (+ 4 (select (select .cse5 .cse3) .cse4))))))))) is different from false [2022-12-14 09:43:46,797 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1706 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1708) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse1 v_ArrVal_1709)) (.cse4 (store (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)))) (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse1 v_ArrVal_1706))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse4 .cse8) .cse9)) (.cse6 (select (select .cse7 .cse8) .cse9))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_1703) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1700))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) v_ArrVal_1715))) (select (select .cse4 .cse5) .cse6)) (+ (select (select .cse7 .cse5) .cse6) 4))))))))) is different from false [2022-12-14 09:43:46,818 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1706 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse3)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_1708) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) .cse1 v_ArrVal_1709)) (.cse4 (store (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse2)))) (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) .cse1 v_ArrVal_1706))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse4 .cse8) .cse9)) (.cse6 (select (select .cse7 .cse8) .cse9))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_1703) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1700))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) v_ArrVal_1715))) (select (select .cse4 .cse5) .cse6)) (+ (select (select .cse7 .cse5) .cse6) 4))))))))) is different from false [2022-12-14 09:43:46,925 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1703 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1700 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_39| Int) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1708 (Array Int Int)) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1727 (Array Int Int)) (v_ArrVal_1726 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_39|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_39| v_ArrVal_1727)) (.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_39| v_ArrVal_1726))) (let ((.cse3 (select (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select .cse12 .cse3) .cse4))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_39| (store v_ArrVal_1727 0 .cse4)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_39| v_ArrVal_1708) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0)) .cse1 v_ArrVal_1709)) (.cse5 (store (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_39| (store v_ArrVal_1726 0 .cse3)))) (store .cse11 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_39|))) .cse1 v_ArrVal_1706))) (let ((.cse9 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse5 .cse9) .cse10)) (.cse7 (select (select .cse8 .cse9) .cse10))) (select (select (let ((.cse0 (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_39| v_ArrVal_1703) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_1700))) (store .cse0 .cse1 (store (select .cse0 .cse1) (select (select .cse2 .cse3) .cse4) v_ArrVal_1715))) (select (select .cse5 .cse6) .cse7)) (+ (select (select .cse8 .cse6) .cse7) 4))))))))) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_39| |c_#StackHeapBarrier|)))) is different from false [2022-12-14 09:43:46,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715678763] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:43:46,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2070464659] [2022-12-14 09:43:46,932 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-12-14 09:43:46,932 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:43:46,932 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:43:46,932 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:43:46,932 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:43:46,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:46,954 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:43:46,954 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-12-14 09:43:46,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:46,961 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-12-14 09:43:46,977 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-12-14 09:43:46,980 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-12-14 09:43:46,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:46,986 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-12-14 09:43:46,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:46,994 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-12-14 09:43:46,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:46,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-12-14 09:43:47,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:47,011 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-12-14 09:43:47,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:47,019 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-12-14 09:43:47,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:47,049 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-12-14 09:43:47,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:47,058 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-12-14 09:43:47,187 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-12-14 09:43:47,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-12-14 09:43:47,197 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-12-14 09:43:47,203 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-12-14 09:43:47,208 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-12-14 09:43:47,215 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:47,216 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:47,216 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:47,217 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:47,218 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:47,364 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-12-14 09:43:47,371 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-12-14 09:43:47,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-12-14 09:43:47,385 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-12-14 09:43:47,392 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-12-14 09:43:47,401 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:47,402 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:47,402 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:47,403 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:47,404 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:47,426 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-12-14 09:43:47,434 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-12-14 09:43:47,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:47,442 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-12-14 09:43:47,525 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-12-14 09:43:47,532 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-12-14 09:43:47,536 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-12-14 09:43:47,636 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-12-14 09:43:47,643 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-12-14 09:43:47,651 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-12-14 09:43:47,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:47,728 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:47,728 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-12-14 09:43:47,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:47,739 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:47,739 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-12-14 09:43:47,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:47,802 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:47,802 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-12-14 09:43:47,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:47,815 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:47,815 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-12-14 09:43:47,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:48,021 INFO L321 Elim1Store]: treesize reduction 59, result has 36.6 percent of original size [2022-12-14 09:43:48,021 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 2 case distinctions, treesize of input 63 treesize of output 34 [2022-12-14 09:43:48,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:48,068 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:43:48,068 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:43:48,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:48,114 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:43:48,115 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:43:48,349 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-12-14 09:43:48,355 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-12-14 09:43:48,360 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-12-14 09:43:48,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:48,375 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-12-14 09:43:48,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:48,380 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-12-14 09:43:48,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:48,390 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-12-14 09:43:48,393 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:43:53,226 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2793#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (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_prepend_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_prepend_~data#1| 5) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= 5 |ULTIMATE.start_sll_circular_prepend_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_prepend_#in~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 09:43:53,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:43:53,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:43:53,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 44 [2022-12-14 09:43:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961701340] [2022-12-14 09:43:53,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:43:53,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-14 09:43:53,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:43:53,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-14 09:43:53,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4640, Unknown=6, NotChecked=700, Total=5550 [2022-12-14 09:43:53,229 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 45 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-14 09:43:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:43:57,690 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-12-14 09:43:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 09:43:57,690 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2022-12-14 09:43:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:43:57,690 INFO L225 Difference]: With dead ends: 43 [2022-12-14 09:43:57,691 INFO L226 Difference]: Without dead ends: 41 [2022-12-14 09:43:57,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=372, Invalid=7298, Unknown=6, NotChecked=880, Total=8556 [2022-12-14 09:43:57,692 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 68 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 09:43:57,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 165 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 09:43:57,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-14 09:43:57,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-12-14 09:43:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:43:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-12-14 09:43:57,703 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 32 [2022-12-14 09:43:57,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:43:57,703 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-12-14 09:43:57,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 35 states have internal predecessors, (47), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-14 09:43:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-12-14 09:43:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 09:43:57,704 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:43:57,704 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:43:57,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 09:43:57,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 09:43:57,906 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:43:57,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:43:57,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1804398593, now seen corresponding path program 1 times [2022-12-14 09:43:57,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:43:57,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359183826] [2022-12-14 09:43:57,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:43:57,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:43:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:43:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 09:43:58,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:43:58,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359183826] [2022-12-14 09:43:58,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359183826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:43:58,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989380809] [2022-12-14 09:43:58,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:43:58,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:43:58,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:43:58,044 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:43:58,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 09:43:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:43:58,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 09:43:58,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:43:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 09:43:58,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:43:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 09:43:58,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989380809] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:43:58,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1531948799] [2022-12-14 09:43:58,275 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-12-14 09:43:58,275 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:43:58,276 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:43:58,276 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:43:58,276 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:43:58,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:58,298 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:43:58,298 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-12-14 09:43:58,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:58,305 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-12-14 09:43:58,326 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-12-14 09:43:58,329 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-12-14 09:43:58,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:58,338 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-12-14 09:43:58,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:58,342 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-12-14 09:43:58,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:58,347 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-12-14 09:43:58,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:58,365 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-12-14 09:43:58,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:58,371 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-12-14 09:43:58,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:58,394 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-12-14 09:43:58,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:58,402 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-12-14 09:43:58,440 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-12-14 09:43:58,448 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-12-14 09:43:58,454 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-12-14 09:43:58,461 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-12-14 09:43:58,468 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-12-14 09:43:58,496 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-12-14 09:43:58,501 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-12-14 09:43:58,507 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-12-14 09:43:58,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-12-14 09:43:58,519 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-12-14 09:43:58,539 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-12-14 09:43:58,544 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-12-14 09:43:58,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:58,553 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-12-14 09:43:58,679 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-12-14 09:43:58,686 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-12-14 09:43:58,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-12-14 09:43:58,700 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-12-14 09:43:58,706 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-12-14 09:43:58,715 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:58,716 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:58,717 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:58,717 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:58,718 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:58,853 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-12-14 09:43:58,858 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-12-14 09:43:58,866 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-12-14 09:43:58,875 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-12-14 09:43:58,884 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-12-14 09:43:58,895 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:58,896 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:58,897 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:58,899 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:58,900 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:58,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:58,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:58,948 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-12-14 09:43:58,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:58,958 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-12-14 09:43:58,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:58,968 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-12-14 09:43:59,257 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:59,258 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:59,258 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:59,259 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:59,260 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:59,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 9 treesize of output 3 [2022-12-14 09:43:59,272 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-12-14 09:43:59,278 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-12-14 09:43:59,284 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-12-14 09:43:59,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-12-14 09:43:59,431 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:59,432 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:59,433 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:59,434 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:59,434 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:43:59,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 9 treesize of output 3 [2022-12-14 09:43:59,447 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-12-14 09:43:59,455 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-12-14 09:43:59,462 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-12-14 09:43:59,469 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-12-14 09:43:59,516 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:43:59,517 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-12-14 09:43:59,533 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 09:43:59,534 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-12-14 09:43:59,545 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-12-14 09:43:59,590 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-12-14 09:43:59,597 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-12-14 09:43:59,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:59,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:59,615 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:59,615 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-12-14 09:43:59,625 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-12-14 09:43:59,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:59,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:59,644 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:59,644 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-12-14 09:43:59,689 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-12-14 09:43:59,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:59,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:59,702 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:59,702 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-12-14 09:43:59,709 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-12-14 09:43:59,716 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-12-14 09:43:59,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:59,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:43:59,729 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:43:59,729 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-12-14 09:43:59,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:59,878 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:43:59,878 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:43:59,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:59,922 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:43:59,922 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:43:59,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:43:59,975 INFO L321 Elim1Store]: treesize reduction 59, result has 36.6 percent of original size [2022-12-14 09:43:59,976 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 2 case distinctions, treesize of input 63 treesize of output 34 [2022-12-14 09:44:00,233 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-12-14 09:44:00,239 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-12-14 09:44:00,246 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-12-14 09:44:00,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:00,263 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-12-14 09:44:00,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:00,269 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-12-14 09:44:00,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:00,276 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-12-14 09:44:00,277 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:44:03,510 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3171#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (not (= |ULTIMATE.start_main_~count~0#1| (+ |ULTIMATE.start_main_~len~0#1| 1))) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (<= 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|)) (= (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_create_~last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~count~0#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_prepend_~data#1| 5) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= 5 |ULTIMATE.start_sll_circular_prepend_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_prepend_#in~data#1|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.offset_52| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_52| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_52|) |v_ULTIMATE.start_main_~ptr~0#1.offset_52|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |v_ULTIMATE.start_main_~ptr~0#1.base_52|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_52| 4))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~ptr~0#1.base_52|) |v_ULTIMATE.start_main_~ptr~0#1.offset_52|) |ULTIMATE.start_main_~ptr~0#1.base|))) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 09:44:03,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:44:03,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:44:03,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-12-14 09:44:03,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899174672] [2022-12-14 09:44:03,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:44:03,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 09:44:03,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:44:03,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 09:44:03,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2022-12-14 09:44:03,512 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 09:44:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:44:03,545 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-12-14 09:44:03,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:44:03,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-12-14 09:44:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:44:03,546 INFO L225 Difference]: With dead ends: 46 [2022-12-14 09:44:03,546 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 09:44:03,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2022-12-14 09:44:03,547 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:44:03,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 91 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:44:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 09:44:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-12-14 09:44:03,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:44:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-12-14 09:44:03,558 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2022-12-14 09:44:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:44:03,558 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-12-14 09:44:03,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 09:44:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-12-14 09:44:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 09:44:03,559 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:44:03,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:44:03,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 09:44:03,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:44:03,760 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:44:03,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:44:03,761 INFO L85 PathProgramCache]: Analyzing trace with hash -101740365, now seen corresponding path program 2 times [2022-12-14 09:44:03,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:44:03,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737872581] [2022-12-14 09:44:03,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:44:03,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:44:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:44:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:44:07,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:44:07,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737872581] [2022-12-14 09:44:07,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737872581] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:44:07,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731190539] [2022-12-14 09:44:07,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 09:44:07,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:44:07,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:44:07,018 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:44:07,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 09:44:07,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 09:44:07,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:44:07,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 169 conjunts are in the unsatisfiable core [2022-12-14 09:44:07,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:44:07,463 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-12-14 09:44:07,750 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 17 treesize of output 9 [2022-12-14 09:44:07,754 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-12-14 09:44:07,757 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-12-14 09:44:07,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:07,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:07,896 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 35 treesize of output 34 [2022-12-14 09:44:07,908 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-14 09:44:07,908 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 15 treesize of output 15 [2022-12-14 09:44:07,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:07,923 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 14 treesize of output 16 [2022-12-14 09:44:08,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:08,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:08,904 INFO L321 Elim1Store]: treesize reduction 66, result has 25.8 percent of original size [2022-12-14 09:44:08,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 319 treesize of output 268 [2022-12-14 09:44:08,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:09,011 INFO L321 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2022-12-14 09:44:09,011 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 7 case distinctions, treesize of input 327 treesize of output 282 [2022-12-14 09:44:09,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:09,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:09,087 INFO L321 Elim1Store]: treesize reduction 73, result has 44.3 percent of original size [2022-12-14 09:44:09,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 281 [2022-12-14 09:44:09,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:09,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:09,118 INFO L321 Elim1Store]: treesize reduction 78, result has 23.5 percent of original size [2022-12-14 09:44:09,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 340 treesize of output 198 [2022-12-14 09:44:09,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 75 [2022-12-14 09:44:09,307 INFO L321 Elim1Store]: treesize reduction 40, result has 57.0 percent of original size [2022-12-14 09:44:09,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 234 treesize of output 292 [2022-12-14 09:44:09,532 INFO L321 Elim1Store]: treesize reduction 29, result has 32.6 percent of original size [2022-12-14 09:44:09,532 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 3 case distinctions, treesize of input 67 treesize of output 33 [2022-12-14 09:44:09,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 207 [2022-12-14 09:44:09,709 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-12-14 09:44:09,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 318 treesize of output 295 [2022-12-14 09:44:09,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 7 [2022-12-14 09:44:09,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 7 [2022-12-14 09:44:09,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 7 [2022-12-14 09:44:10,024 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-12-14 09:44:10,024 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 3 case distinctions, treesize of input 41 treesize of output 7 [2022-12-14 09:44:10,146 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:44:17,362 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 144 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:44:18,505 INFO L321 Elim1Store]: treesize reduction 126, result has 44.0 percent of original size [2022-12-14 09:44:18,505 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 389 treesize of output 371 [2022-12-14 09:44:18,670 INFO L321 Elim1Store]: treesize reduction 329, result has 27.4 percent of original size [2022-12-14 09:44:18,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 16 new quantified variables, introduced 34 case distinctions, treesize of input 296 treesize of output 300 [2022-12-14 09:44:19,493 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 13 treesize of output 9 [2022-12-14 09:44:19,539 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 13 treesize of output 9 [2022-12-14 09:44:19,610 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 13 treesize of output 9 [2022-12-14 09:44:19,691 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 13 treesize of output 9 [2022-12-14 09:44:19,732 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 13 treesize of output 9 [2022-12-14 09:44:19,814 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 13 treesize of output 9 [2022-12-14 09:44:19,912 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 13 treesize of output 9 [2022-12-14 09:44:20,123 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 09:44:20,123 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 33 treesize of output 27 [2022-12-14 09:44:20,166 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 09:44:20,166 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 33 treesize of output 27 [2022-12-14 09:44:20,249 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-14 09:44:20,250 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 562 treesize of output 525 [2022-12-14 09:44:20,785 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 09:44:20,785 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 27 treesize of output 23 [2022-12-14 09:44:20,805 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 125 treesize of output 117 [2022-12-14 09:44:21,060 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 19 treesize of output 13 [2022-12-14 09:44:21,062 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 13 treesize of output 9 [2022-12-14 09:44:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:44:21,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:44:27,037 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| Int)) (or (forall ((v_ArrVal_2104 Int)) (let ((.cse11 (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0 0) 4 v_ArrVal_2104))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| .cse11))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (= .cse0 0) (forall ((v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2103 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2103))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (select (select .cse1 .cse0) .cse14)) (.cse3 (select (select .cse15 .cse0) .cse14))) (or (not (= .cse0 (select (select .cse1 .cse2) .cse3))) (= .cse2 .cse0) (let ((.cse4 (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store v_ArrVal_2103 0 .cse14)))) (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))))) (store .cse12 .cse2 (store (select .cse12 .cse2) .cse3 0))))) (let ((.cse9 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse5 (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store .cse11 0 .cse0)))) (store (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2090) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse2 (store (select (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse2) .cse3 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|))))) (let ((.cse8 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select .cse5 .cse8) .cse9)) (.cse7 (select (select .cse4 .cse8) .cse9))) (select (select .cse4 (select (select .cse5 .cse6) .cse7)) (select (select .cse4 .cse6) .cse7))))) .cse9))))))))))))) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0)) (forall ((v_ArrVal_2103 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2103))) (let ((.cse16 (select (select .cse31 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (= .cse16 0) (forall ((v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2104 Int)) (let ((.cse28 (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0 0) 4 v_ArrVal_2104))) (let ((.cse30 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| .cse28))) (let ((.cse29 (select (select .cse30 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse25 (select (select .cse30 .cse29) .cse16)) (.cse17 (select (select .cse31 .cse29) .cse16))) (or (= .cse17 .cse16) (let ((.cse19 (let ((.cse27 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store .cse28 0 .cse29)))) (store (store .cse27 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2090) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse25 (store (select (store .cse27 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse27 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse25) .cse17 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|))))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse18 (let ((.cse22 (let ((.cse24 (let ((.cse26 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store v_ArrVal_2103 0 .cse16)))) (store .cse26 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse26 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))))) (store .cse24 .cse25 (store (select .cse24 .cse25) .cse17 0))))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (select (select .cse19 .cse18) .cse23)) (.cse21 (select (select .cse22 .cse18) .cse23))) (select (select .cse19 (select (select .cse19 .cse20) .cse21)) (select (select .cse22 .cse20) .cse21)))))))) (not (= .cse29 (select (select .cse30 .cse25) .cse17))))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0)) (forall ((v_ArrVal_2103 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2103))) (let ((.cse32 (select (select .cse47 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (= .cse32 0) (forall ((v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2104 Int)) (let ((.cse44 (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0 0) 4 v_ArrVal_2104))) (let ((.cse46 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| .cse44))) (let ((.cse45 (select (select .cse46 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse41 (select (select .cse47 .cse45) .cse32)) (.cse40 (select (select .cse46 .cse45) .cse32))) (or (let ((.cse34 (let ((.cse43 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store .cse44 0 .cse45)))) (store (store .cse43 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2090) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse40 (store (select (store .cse43 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse43 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse40) .cse41 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|))))) (let ((.cse33 (select (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse33 (let ((.cse37 (let ((.cse39 (let ((.cse42 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store v_ArrVal_2103 0 .cse32)))) (store .cse42 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))))) (store .cse39 .cse40 (store (select .cse39 .cse40) .cse41 0))))) (let ((.cse38 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse35 (select (select .cse34 .cse33) .cse38)) (.cse36 (select (select .cse37 .cse33) .cse38))) (select (select .cse34 (select (select .cse34 .cse35) .cse36)) (select (select .cse37 .cse35) .cse36)))))))) (not (= .cse45 (select (select .cse46 .cse40) .cse41))) (= .cse40 .cse45))))))))))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| Int)) (or (forall ((v_ArrVal_2104 Int)) (let ((.cse60 (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0 0) 4 v_ArrVal_2104))) (let ((.cse51 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| .cse60))) (let ((.cse48 (select (select .cse51 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (= .cse48 0) (forall ((v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2103 (Array Int Int))) (let ((.cse63 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2103))) (let ((.cse50 (select (select .cse63 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse52 (select (select .cse51 .cse48) .cse50)) (.cse49 (select (select .cse63 .cse48) .cse50))) (or (= .cse49 .cse50) (not (= .cse48 (select (select .cse51 .cse52) .cse49))) (let ((.cse53 (let ((.cse61 (let ((.cse62 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store v_ArrVal_2103 0 .cse50)))) (store .cse62 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse62 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))))) (store .cse61 .cse52 (store (select .cse61 .cse52) .cse49 0))))) (let ((.cse58 (select (select .cse53 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse54 (let ((.cse59 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store .cse60 0 .cse48)))) (store (store .cse59 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2090) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse52 (store (select (store .cse59 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse59 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse52) .cse49 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|))))) (let ((.cse57 (select (select .cse54 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse55 (select (select .cse54 .cse57) .cse58)) (.cse56 (select (select .cse53 .cse57) .cse58))) (select (select .cse53 (select (select .cse54 .cse55) .cse56)) (select (select .cse53 .cse55) .cse56))))) .cse58))))))))))))) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| Int)) (or (forall ((v_ArrVal_2104 Int)) (let ((.cse76 (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0 0) 4 v_ArrVal_2104))) (let ((.cse78 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| .cse76))) (let ((.cse77 (select (select .cse78 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2103 (Array Int Int))) (let ((.cse79 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2103))) (let ((.cse65 (select (select .cse79 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse73 (select (select .cse78 .cse77) .cse65)) (.cse64 (select (select .cse79 .cse77) .cse65))) (or (= .cse64 .cse65) (let ((.cse67 (let ((.cse75 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store .cse76 0 .cse77)))) (store (store .cse75 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2090) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse73 (store (select (store .cse75 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse75 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse73) .cse64 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|))))) (let ((.cse66 (select (select .cse67 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse66 (let ((.cse70 (let ((.cse72 (let ((.cse74 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store v_ArrVal_2103 0 .cse65)))) (store .cse74 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse74 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))))) (store .cse72 .cse73 (store (select .cse72 .cse73) .cse64 0))))) (let ((.cse71 (select (select .cse70 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse68 (select (select .cse67 .cse66) .cse71)) (.cse69 (select (select .cse70 .cse66) .cse71))) (select (select .cse67 (select (select .cse67 .cse68) .cse69)) (select (select .cse70 .cse68) .cse69)))))))) (not (= .cse77 (select (select .cse78 .cse73) .cse64)))))))) (= .cse77 0)))))) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| Int)) (or (forall ((v_ArrVal_2103 (Array Int Int))) (let ((.cse95 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2103))) (let ((.cse94 (select (select .cse95 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2104 Int)) (let ((.cse91 (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0 0) 4 v_ArrVal_2104))) (let ((.cse81 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| .cse91))) (let ((.cse80 (select (select .cse81 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse82 (select (select .cse81 .cse80) .cse94)) (.cse83 (select (select .cse95 .cse80) .cse94))) (or (not (= .cse80 (select (select .cse81 .cse82) .cse83))) (= .cse82 .cse80) (let ((.cse84 (let ((.cse92 (let ((.cse93 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store v_ArrVal_2103 0 .cse94)))) (store .cse93 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse93 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))))) (store .cse92 .cse82 (store (select .cse92 .cse82) .cse83 0))))) (let ((.cse89 (select (select .cse84 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse85 (let ((.cse90 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store .cse91 0 .cse80)))) (store (store .cse90 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2090) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse82 (store (select (store .cse90 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse90 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse82) .cse83 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|))))) (let ((.cse88 (select (select .cse85 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse86 (select (select .cse85 .cse88) .cse89)) (.cse87 (select (select .cse84 .cse88) .cse89))) (select (select .cse84 (select (select .cse85 .cse86) .cse87)) (select (select .cse84 .cse86) .cse87))))) .cse89))))))))) (= .cse94 0))))) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| Int)) (or (forall ((v_ArrVal_2104 Int)) (let ((.cse109 (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0 0) 4 v_ArrVal_2104))) (let ((.cse110 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| .cse109))) (let ((.cse96 (select (select .cse110 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (= .cse96 0) (forall ((v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2103 (Array Int Int))) (let ((.cse111 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2103))) (let ((.cse107 (select (select .cse111 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse105 (select (select .cse111 .cse96) .cse107)) (.cse104 (select (select .cse110 .cse96) .cse107))) (or (let ((.cse98 (let ((.cse108 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store .cse109 0 .cse96)))) (store (store .cse108 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2090) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse104 (store (select (store .cse108 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse108 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse104) .cse105 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|))))) (let ((.cse97 (select (select .cse98 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse97 (let ((.cse101 (let ((.cse103 (let ((.cse106 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store v_ArrVal_2103 0 .cse107)))) (store .cse106 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse106 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))))) (store .cse103 .cse104 (store (select .cse103 .cse104) .cse105 0))))) (let ((.cse102 (select (select .cse101 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse99 (select (select .cse98 .cse97) .cse102)) (.cse100 (select (select .cse101 .cse97) .cse102))) (select (select .cse98 (select (select .cse98 .cse99) .cse100)) (select (select .cse101 .cse99) .cse100)))))))) (not (= .cse96 (select (select .cse110 .cse104) .cse105))) (= .cse104 .cse96))))))))))) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0)))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| Int)) (or (forall ((v_ArrVal_2103 (Array Int Int))) (let ((.cse127 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2103))) (let ((.cse113 (select (select .cse127 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2104 Int)) (let ((.cse124 (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0 0) 4 v_ArrVal_2104))) (let ((.cse115 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| .cse124))) (let ((.cse114 (select (select .cse115 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse116 (select (select .cse115 .cse114) .cse113)) (.cse112 (select (select .cse127 .cse114) .cse113))) (or (= .cse112 .cse113) (not (= .cse114 (select (select .cse115 .cse116) .cse112))) (let ((.cse117 (let ((.cse125 (let ((.cse126 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store v_ArrVal_2103 0 .cse113)))) (store .cse126 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse126 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0))))) (store .cse125 .cse116 (store (select .cse125 .cse116) .cse112 0))))) (let ((.cse122 (select (select .cse117 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse118 (let ((.cse123 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| (store .cse124 0 .cse114)))) (store (store .cse123 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| v_ArrVal_2090) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse116 (store (select (store .cse123 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse123 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|)) .cse116) .cse112 |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|))))) (let ((.cse121 (select (select .cse118 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse119 (select (select .cse118 .cse121) .cse122)) (.cse120 (select (select .cse117 .cse121) .cse122))) (select (select .cse117 (select (select .cse118 .cse119) .cse120)) (select (select .cse117 .cse119) .cse120))))) .cse122))))))))) (= .cse113 0))))) (not (< |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_47|) 0))))) is different from true [2022-12-14 09:44:27,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731190539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:44:27,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1195678360] [2022-12-14 09:44:27,041 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-12-14 09:44:27,041 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:44:27,041 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:44:27,041 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:44:27,041 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:44:27,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:27,063 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 09:44:27,063 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-12-14 09:44:27,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:27,070 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-12-14 09:44:27,084 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-12-14 09:44:27,087 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-12-14 09:44:27,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:27,092 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-12-14 09:44:27,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:27,098 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-12-14 09:44:27,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:27,102 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-12-14 09:44:27,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:27,117 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-12-14 09:44:27,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:27,125 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-12-14 09:44:27,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:27,152 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-12-14 09:44:27,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:27,160 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-12-14 09:44:27,309 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-12-14 09:44:27,317 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-12-14 09:44:27,323 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-12-14 09:44:27,329 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-12-14 09:44:27,334 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-12-14 09:44:27,340 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:44:27,341 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:44:27,342 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:44:27,343 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:44:27,344 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:44:27,476 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-12-14 09:44:27,482 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-12-14 09:44:27,488 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-12-14 09:44:27,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-12-14 09:44:27,502 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-12-14 09:44:27,510 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:44:27,511 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:44:27,512 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:44:27,512 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:44:27,513 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 09:44:27,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:44:27,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:27,562 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-12-14 09:44:27,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:44:27,572 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-12-14 09:44:27,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:44:27,584 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-12-14 09:44:27,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:27,702 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 144 treesize of output 126 [2022-12-14 09:44:27,711 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 140 treesize of output 128 [2022-12-14 09:44:27,718 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-12-14 09:44:27,838 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-12-14 09:44:27,853 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-12-14 09:44:27,859 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-12-14 09:44:27,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:44:27,936 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:44:27,937 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-12-14 09:44:27,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:44:27,956 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:44:27,956 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-12-14 09:44:28,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:44:28,022 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:44:28,022 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-12-14 09:44:28,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:44:28,032 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 09:44:28,032 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-12-14 09:44:28,133 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:44:28,161 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:44:28,161 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:44:28,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:44:28,182 INFO L321 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-12-14 09:44:28,182 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 11 [2022-12-14 09:44:28,200 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-12-14 09:44:28,201 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 27 treesize of output 23 [2022-12-14 09:44:28,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:44:28,240 INFO L321 Elim1Store]: treesize reduction 71, result has 26.8 percent of original size [2022-12-14 09:44:28,240 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 4 case distinctions, treesize of input 87 treesize of output 36 [2022-12-14 09:44:28,434 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-12-14 09:44:28,441 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-12-14 09:44:28,445 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-12-14 09:44:28,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:28,460 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-12-14 09:44:28,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:28,466 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-12-14 09:44:28,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:44:28,474 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-12-14 09:44:28,475 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:44:33,285 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3526#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (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_prepend_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_prepend_~data#1| 5) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= 5 |ULTIMATE.start_sll_circular_prepend_~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_prepend_#in~data#1|) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 5) (<= 0 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 09:44:33,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:44:33,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 09:44:33,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 45 [2022-12-14 09:44:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183558921] [2022-12-14 09:44:33,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 09:44:33,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-14 09:44:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:44:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-14 09:44:33,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=5259, Unknown=4, NotChecked=146, Total=5700 [2022-12-14 09:44:33,287 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 45 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 09:44:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:44:36,081 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-12-14 09:44:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 09:44:36,081 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2022-12-14 09:44:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:44:36,082 INFO L225 Difference]: With dead ends: 41 [2022-12-14 09:44:36,082 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 09:44:36,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2358 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=429, Invalid=7581, Unknown=4, NotChecked=176, Total=8190 [2022-12-14 09:44:36,083 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 09:44:36,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 74 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 09:44:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 09:44:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 09:44:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:44:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 09:44:36,083 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-12-14 09:44:36,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:44:36,083 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 09:44:36,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 09:44:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 09:44:36,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 09:44:36,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 09:44:36,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 09:44:36,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:44:36,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 09:45:26,411 WARN L233 SmtUtils]: Spent 50.00s on a formula simplification. DAG size of input: 90 DAG size of output: 33 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 09:45:59,869 WARN L233 SmtUtils]: Spent 26.85s on a formula simplification. DAG size of input: 258 DAG size of output: 173 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 09:46:01,178 INFO L899 garLoopResultBuilder]: For program point L613-4(lines 613 615) no Hoare annotation was computed. [2022-12-14 09:46:01,179 INFO L899 garLoopResultBuilder]: For program point L634(lines 634 636) no Hoare annotation was computed. [2022-12-14 09:46:01,179 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 621 647) the Hoare annotation is: true [2022-12-14 09:46:01,179 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 620) no Hoare annotation was computed. [2022-12-14 09:46:01,179 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 645) no Hoare annotation was computed. [2022-12-14 09:46:01,179 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2022-12-14 09:46:01,179 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse1 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse3 (<= |#NULL.offset| 0)) (.cse4 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse5 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse9 (< |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|)) (.cse10 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|)) (.cse11 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse12 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse13 (<= 0 |#NULL.offset|)) (.cse14 (<= 0 |#StackHeapBarrier|)) (.cse16 (= |#NULL.base| 0))) (or (and .cse0 (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse1 (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) .cse2 .cse3 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) .cse10 .cse11 .cse12 .cse13 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) .cse14 (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_40| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_40| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_40| |#valid|))) (store |v_old(#valid)_AFTER_CALL_40| .cse15 (select |#valid| .cse15))) |#valid|))) .cse16) (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) .cse0 .cse1 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse2 .cse3 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) .cse4 (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) .cse5 .cse6 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_77| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= (store |v_#valid_BEFORE_CALL_77| |ULTIMATE.start_sll_circular_create_~head~0#1.base| 1) |#valid|) (= |v_#valid_BEFORE_CALL_77| (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse17 (select |v_#valid_BEFORE_CALL_77| .cse17)))) (= (select |v_#valid_BEFORE_CALL_77| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 1))) .cse14 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) .cse16))) [2022-12-14 09:46:01,179 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 09:46:01,179 INFO L895 garLoopResultBuilder]: At program point L607(line 607) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |#memory_$Pointer$.base| .cse2)) (.cse3 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select .cse5 .cse3)) (.cse4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_#valid_BEFORE_CALL_77| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_42| .cse0) 0) (= |v_#valid_BEFORE_CALL_77| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_42| |v_#valid_BEFORE_CALL_77|))) (store |v_old(#valid)_AFTER_CALL_42| .cse1 (select |v_#valid_BEFORE_CALL_77| .cse1)))) (= (select |v_#valid_BEFORE_CALL_77| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (store |v_#valid_BEFORE_CALL_77| .cse2 1) |#valid|) (= (select |v_#valid_BEFORE_CALL_77| .cse2) 0))) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (= .cse3 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (not (= .cse4 0)) (= |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_create_~head~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (< (select .cse5 0) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset|) (= .cse3 (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| .cse4) .cse6)) 0) .cse4) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| |ULTIMATE.start_main_~uneq~0#1|) (= |ULTIMATE.start_sll_circular_prepend_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_#res#1.base| .cse2) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_int| .cse0) 4) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| .cse0) .cse3) 0) (<= 0 |#NULL.offset|) (= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_sll_circular_prepend_~data#1|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| .cse2) 4)) (= |#NULL.base| 0) (= (select (select |#memory_$Pointer$.offset| .cse4) .cse6) 0))))) [2022-12-14 09:46:01,180 INFO L899 garLoopResultBuilder]: For program point L607-1(line 607) no Hoare annotation was computed. [2022-12-14 09:46:01,180 INFO L899 garLoopResultBuilder]: For program point L628(lines 628 630) no Hoare annotation was computed. [2022-12-14 09:46:01,180 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2022-12-14 09:46:01,180 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (< 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 2) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (< |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |#NULL.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= 0 |#StackHeapBarrier|) (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_40| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_40| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_40| |#valid|))) (store |v_old(#valid)_AFTER_CALL_40| .cse0 (select |#valid| .cse0))) |#valid|))) (= |#NULL.base| 0)) [2022-12-14 09:46:01,180 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2022-12-14 09:46:01,180 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 09:46:01,180 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 619) no Hoare annotation was computed. [2022-12-14 09:46:01,180 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 621 647) the Hoare annotation is: false [2022-12-14 09:46:01,180 INFO L899 garLoopResultBuilder]: For program point L633-2(lines 633 639) no Hoare annotation was computed. [2022-12-14 09:46:01,180 INFO L895 garLoopResultBuilder]: At program point L633-4(lines 633 639) the Hoare annotation is: (let ((.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse48 (select |#memory_$Pointer$.base| .cse8))) (let ((.cse43 (select .cse48 0))) (let ((.cse42 (select |#memory_$Pointer$.offset| .cse43)) (.cse40 (select |#memory_$Pointer$.base| .cse43)) (.cse44 (select |#memory_$Pointer$.offset| .cse8)) (.cse45 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse15 (select .cse48 .cse45)) (.cse41 (select .cse44 0)) (.cse46 (select .cse40 0)) (.cse47 (select .cse42 0))) (let ((.cse0 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse1 (<= (+ 2 .cse8) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse3 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse5 (= .cse45 0)) (.cse6 (= (select (select |#memory_$Pointer$.offset| .cse46) .cse47) 0)) (.cse9 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse10 (<= |#NULL.offset| 0)) (.cse11 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)) (.cse12 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse13 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse14 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse18 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse19 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse20 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse21 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0))) (.cse22 (<= |ULTIMATE.start_sll_circular_create_~len#1| 2)) (.cse23 (= (select (select |#memory_$Pointer$.base| .cse46) .cse47) .cse8)) (.cse24 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse25 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse16 (select .cse44 .cse45)) (.cse26 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse27 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse28 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse29 (not (= .cse43 0))) (.cse30 (<= 0 |ULTIMATE.start_main_~#s~0#1.base|)) (.cse31 (= .cse41 0)) (.cse32 (<= 0 |#NULL.offset|)) (.cse33 (<= (+ 2 .cse43) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse34 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (.cse35 (<= 0 |#StackHeapBarrier|)) (.cse36 (= (select .cse42 .cse41) 0)) (.cse37 (= |#NULL.base| 0)) (.cse7 (select .cse40 .cse41)) (.cse17 (select |#memory_$Pointer$.base| .cse15))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_main_~count~0#1| 2) .cse2 .cse3 .cse4 (= (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|) (<= 2 |ULTIMATE.start_main_~count~0#1|) .cse5 .cse6 (not (= .cse7 .cse8)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= (select (select |#memory_$Pointer$.offset| .cse15) .cse16) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select .cse17 .cse16)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= (+ .cse7 2) |ULTIMATE.start_main_~#s~0#1.base|) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (let ((.cse39 (select .cse17 0)) (.cse38 (select (select |#memory_int| .cse7) 4))) (and (= .cse15 |ULTIMATE.start_main_~ptr~0#1.base|) .cse0 .cse1 (= |ULTIMATE.start_main_~count~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (<= 1 .cse38) .cse2 .cse3 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= .cse39 .cse8)) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= .cse16 |ULTIMATE.start_main_~ptr~0#1.offset|) .cse26 .cse27 .cse28 .cse29 (<= (+ .cse39 2) |ULTIMATE.start_main_~#s~0#1.base|) .cse30 .cse31 (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_int| .cse15) 4) |ULTIMATE.start_main_~data~0#1|) (<= .cse38 1) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37))))))))) [2022-12-14 09:46:01,180 INFO L899 garLoopResultBuilder]: For program point L633-5(lines 621 647) no Hoare annotation was computed. [2022-12-14 09:46:01,181 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2022-12-14 09:46:01,181 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |#length| 2) 24) (= 2 (select |#length| 1)) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_sll_circular_create_#in~len#1| |ULTIMATE.start_sll_circular_create_~len#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| 1) 1) (= |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_~data#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select |#length| |ULTIMATE.start_main_~#s~0#1.base|) 4) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-12-14 09:46:01,181 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2022-12-14 09:46:01,181 INFO L899 garLoopResultBuilder]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2022-12-14 09:46:01,181 INFO L895 garLoopResultBuilder]: At program point L613-3(lines 613 615) the Hoare annotation is: (let ((.cse53 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse55 (select |#memory_$Pointer$.base| .cse53)) (.cse54 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse49 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse50 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) |ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse27 (select (select |#memory_$Pointer$.offset| .cse49) .cse50)) (.cse12 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse16 (select (select |#memory_$Pointer$.base| .cse49) .cse50)) (.cse51 (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 2)) (.cse52 (select .cse55 .cse54))) (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse1 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse2 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse3 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse4 (< .cse53 |#StackHeapBarrier|)) (.cse5 (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse57 (@diff |v_old(#valid)_AFTER_CALL_44| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_44| .cse57 (select |v_#valid_BEFORE_CALL_80| .cse57)))) (= (select |v_old(#valid)_AFTER_CALL_44| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_44| .cse52) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse53) 0) (= (select |v_#valid_BEFORE_CALL_80| .cse52) 1) (= (select (store |v_#valid_BEFORE_CALL_80| .cse53 1) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) 0)) (.cse7 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse8 (<= |#NULL.offset| 0)) (.cse9 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1)) (.cse10 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse11 (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|)) (.cse13 (exists ((|v_old(#valid)_AFTER_CALL_40| (Array Int Int)) (|v_#valid_BEFORE_CALL_76| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22| Int)) (and (= |v_#valid_BEFORE_CALL_76| (let ((.cse56 (@diff |v_old(#valid)_AFTER_CALL_40| |v_#valid_BEFORE_CALL_76|))) (store |v_old(#valid)_AFTER_CALL_40| .cse56 (select |v_#valid_BEFORE_CALL_76| .cse56)))) (<= .cse51 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_47|) 1) (= (select |v_#valid_BEFORE_CALL_76| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 1) (= (select |v_old(#valid)_AFTER_CALL_40| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_22|) 0)))) (.cse14 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse15 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|)) (.cse17 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse18 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0))) (.cse19 (not (= .cse49 0))) (.cse20 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse21 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse22 (< |ULTIMATE.start_sll_circular_create_~head~0#1.base| |#StackHeapBarrier|)) (.cse23 (< |#StackHeapBarrier| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse24 (= |ULTIMATE.start_main_~uneq~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ 4 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (.cse25 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|)) (.cse26 (< (select .cse55 0) |#StackHeapBarrier|)) (.cse28 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse29 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse30 (= .cse54 (select (select |#memory_$Pointer$.offset| .cse53) .cse54))) (.cse31 (= (select (select |#memory_$Pointer$.base| .cse16) 0) .cse49)) (.cse32 (= |ULTIMATE.start_sll_circular_prepend_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse33 (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse34 (= (select |#valid| .cse49) 1)) (.cse35 (= (select (select |#memory_int| .cse52) 4) |ULTIMATE.start_main_~data~0#1|)) (.cse36 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (.cse37 (= .cse50 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse38 (= (select (select |#memory_$Pointer$.offset| .cse52) .cse54) 0)) (.cse39 (<= 0 |#NULL.offset|)) (.cse40 (= .cse50 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) (.cse41 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (.cse42 (<= 0 |#StackHeapBarrier|)) (.cse43 (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| .cse53) 4))) (.cse44 (= (select |#valid| .cse52) 1)) (.cse45 (= .cse12 0)) (.cse46 (<= .cse51 |ULTIMATE.start_main_~#s~0#1.base|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= .cse27 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) .cse10 .cse11 (= .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) .cse13 .cse14 .cse15 (= |ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse16) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (= .cse27 |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse5 .cse6 (= .cse49 |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) .cse7 .cse8 .cse9 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 (= |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse50) .cse43 .cse44 .cse45 .cse46 .cse47 .cse48)))))) [2022-12-14 09:46:01,181 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-12-14 09:46:01,181 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-12-14 09:46:01,181 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 574 582) the Hoare annotation is: (or (not (<= 0 |#NULL.offset|)) (not (<= 1 |node_create_#in~data#1|)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (not (<= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (<= |node_create_#in~data#1| 5)) (not (<= 0 |#StackHeapBarrier|))) [2022-12-14 09:46:01,181 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2022-12-14 09:46:01,183 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:46:01,185 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 09:46:01,191 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:588) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:348) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:481) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 09:46:01,193 INFO L158 Benchmark]: Toolchain (without parser) took 223535.94ms. Allocated memory was 140.5MB in the beginning and 343.9MB in the end (delta: 203.4MB). Free memory was 98.9MB in the beginning and 102.1MB in the end (delta: -3.2MB). Peak memory consumption was 217.4MB. Max. memory is 16.1GB. [2022-12-14 09:46:01,193 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 140.5MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:46:01,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.73ms. Allocated memory is still 140.5MB. Free memory was 98.9MB in the beginning and 81.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 09:46:01,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.16ms. Allocated memory is still 140.5MB. Free memory was 81.3MB in the beginning and 79.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:46:01,193 INFO L158 Benchmark]: Boogie Preprocessor took 24.20ms. Allocated memory is still 140.5MB. Free memory was 79.2MB in the beginning and 77.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 09:46:01,193 INFO L158 Benchmark]: RCFGBuilder took 375.97ms. Allocated memory was 140.5MB in the beginning and 197.1MB in the end (delta: 56.6MB). Free memory was 77.1MB in the beginning and 158.3MB in the end (delta: -81.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-12-14 09:46:01,193 INFO L158 Benchmark]: TraceAbstraction took 222828.34ms. Allocated memory was 197.1MB in the beginning and 343.9MB in the end (delta: 146.8MB). Free memory was 157.5MB in the beginning and 102.1MB in the end (delta: 55.4MB). Peak memory consumption was 217.7MB. Max. memory is 16.1GB. [2022-12-14 09:46:01,194 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 140.5MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.73ms. Allocated memory is still 140.5MB. Free memory was 98.9MB in the beginning and 81.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.16ms. Allocated memory is still 140.5MB. Free memory was 81.3MB in the beginning and 79.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.20ms. Allocated memory is still 140.5MB. Free memory was 79.2MB in the beginning and 77.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.97ms. Allocated memory was 140.5MB in the beginning and 197.1MB in the end (delta: 56.6MB). Free memory was 77.1MB in the beginning and 158.3MB in the end (delta: -81.2MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 222828.34ms. Allocated memory was 197.1MB in the beginning and 343.9MB in the end (delta: 146.8MB). Free memory was 157.5MB in the beginning and 102.1MB in the end (delta: 55.4MB). Peak memory consumption was 217.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 645]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 222.8s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 84.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 668 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 663 mSDsluCounter, 2008 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 436 IncrementalHoareTripleChecker+Unchecked, 1818 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4949 IncrementalHoareTripleChecker+Invalid, 5505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 190 mSDtfsCounter, 4949 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1054 GetRequests, 377 SyntacticMatches, 16 SemanticMatches, 661 ConstructedPredicates, 46 IntricatePredicates, 0 DeprecatedPredicates, 9973 ImplicationChecksByTransitivity, 85.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=8, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 59 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 21 PreInvPairs, 31 NumberOfFragments, 2428 HoareAnnotationTreeSize, 21 FomulaSimplifications, 257 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 5168 FormulaSimplificationTreeSizeReductionInter, 84.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 55.3s InterpolantComputationTime, 658 NumberOfCodeBlocks, 658 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 668 ConstructedInterpolants, 37 QuantifiedInterpolants, 21349 SizeOfPredicates, 233 NumberOfNonLiveVariables, 4280 ConjunctsInSsa, 1078 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 208/328 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 1.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 17, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 16, TOOLS_POST_TIME: 0.6s, TOOLS_POST_CALL_APPLICATIONS: 13, TOOLS_POST_CALL_TIME: 0.6s, TOOLS_POST_RETURN_APPLICATIONS: 10, TOOLS_POST_RETURN_TIME: 0.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 39, TOOLS_QUANTIFIERELIM_TIME: 1.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 52, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 9, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 17, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.7s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.7s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 10, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 167, DAG_COMPRESSION_RETAINED_NODES: 50, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 621]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 621]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:588) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-14 09:46:01,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh --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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- 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-2329fc7 [2022-12-14 09:46:02,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:46:02,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:46:02,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:46:02,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:46:02,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:46:02,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:46:02,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:46:02,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:46:02,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:46:02,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:46:02,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:46:02,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:46:02,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:46:02,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:46:02,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:46:02,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:46:02,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:46:02,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:46:02,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:46:02,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:46:02,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:46:02,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:46:02,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:46:02,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:46:02,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:46:02,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:46:02,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:46:02,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:46:02,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:46:02,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:46:02,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:46:02,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:46:02,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:46:02,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:46:02,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:46:02,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:46:02,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:46:02,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:46:02,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:46:02,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:46:02,831 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 09:46:02,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:46:02,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:46:02,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:46:02,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:46:02,855 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:46:02,855 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:46:02,855 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:46:02,855 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:46:02,856 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:46:02,856 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:46:02,856 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:46:02,856 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:46:02,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:46:02,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 09:46:02,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 09:46:02,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:46:02,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 09:46:02,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:46:02,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 09:46:02,858 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 09:46:02,858 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 09:46:02,859 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 09:46:02,859 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 09:46:02,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 09:46:02,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:46:02,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 09:46:02,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:46:02,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 09:46:02,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:46:02,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:46:02,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:46:02,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:46:02,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 09:46:02,861 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 09:46:02,861 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 09:46:02,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 09:46:02,861 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:46:02,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 09:46:02,862 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/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_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2022-12-14 09:46:03,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:46:03,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:46:03,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:46:03,118 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:46:03,118 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:46:03,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-12-14 09:46:05,728 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:46:05,926 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:46:05,926 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-12-14 09:46:05,934 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/data/90effc16a/2eb632f85fa34104bdc7dcc9bdd086a7/FLAGd10f14e47 [2022-12-14 09:46:05,944 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/data/90effc16a/2eb632f85fa34104bdc7dcc9bdd086a7 [2022-12-14 09:46:05,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:46:05,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:46:05,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:46:05,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:46:05,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:46:05,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:46:05" (1/1) ... [2022-12-14 09:46:05,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c71d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:05, skipping insertion in model container [2022-12-14 09:46:05,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:46:05" (1/1) ... [2022-12-14 09:46:05,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:46:05,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:46:06,175 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_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2022-12-14 09:46:06,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:46:06,192 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:46:06,221 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_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2022-12-14 09:46:06,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:46:06,239 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:46:06,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06 WrapperNode [2022-12-14 09:46:06,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:46:06,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:46:06,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:46:06,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:46:06,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06" (1/1) ... [2022-12-14 09:46:06,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06" (1/1) ... [2022-12-14 09:46:06,273 INFO L138 Inliner]: procedures = 130, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 147 [2022-12-14 09:46:06,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:46:06,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:46:06,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:46:06,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:46:06,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06" (1/1) ... [2022-12-14 09:46:06,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06" (1/1) ... [2022-12-14 09:46:06,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06" (1/1) ... [2022-12-14 09:46:06,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06" (1/1) ... [2022-12-14 09:46:06,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06" (1/1) ... [2022-12-14 09:46:06,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06" (1/1) ... [2022-12-14 09:46:06,296 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06" (1/1) ... [2022-12-14 09:46:06,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06" (1/1) ... [2022-12-14 09:46:06,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:46:06,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:46:06,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:46:06,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:46:06,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06" (1/1) ... [2022-12-14 09:46:06,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:46:06,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:46:06,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:46:06,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:46:06,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 09:46:06,362 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-14 09:46:06,362 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-14 09:46:06,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 09:46:06,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:46:06,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 09:46:06,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 09:46:06,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 09:46:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 09:46:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 09:46:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 09:46:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 09:46:06,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:46:06,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:46:06,461 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:46:06,463 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:46:06,760 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:46:06,766 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:46:06,766 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 09:46:06,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:46:06 BoogieIcfgContainer [2022-12-14 09:46:06,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:46:06,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:46:06,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:46:06,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:46:06,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:46:05" (1/3) ... [2022-12-14 09:46:06,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e51ed4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:46:06, skipping insertion in model container [2022-12-14 09:46:06,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:46:06" (2/3) ... [2022-12-14 09:46:06,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e51ed4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:46:06, skipping insertion in model container [2022-12-14 09:46:06,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:46:06" (3/3) ... [2022-12-14 09:46:06,776 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2022-12-14 09:46:06,794 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:46:06,794 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 09:46:06,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:46:06,846 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;@3b0d2ec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:46:06,846 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 09:46:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 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-12-14 09:46:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 09:46:06,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:46:06,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:46:06,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:46:06,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:46:06,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1454169709, now seen corresponding path program 1 times [2022-12-14 09:46:06,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:46:06,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321242119] [2022-12-14 09:46:06,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:46:06,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:46:06,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:46:06,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:46:06,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 09:46:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:46:07,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 09:46:07,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:46:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:46:07,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:46:07,075 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:46:07,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321242119] [2022-12-14 09:46:07,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321242119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:46:07,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:46:07,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:46:07,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773265746] [2022-12-14 09:46:07,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:46:07,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 09:46:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:46:07,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 09:46:07,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 09:46:07,113 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 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 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:46:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:46:07,134 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-12-14 09:46:07,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 09:46:07,136 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-12-14 09:46:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:46:07,147 INFO L225 Difference]: With dead ends: 67 [2022-12-14 09:46:07,147 INFO L226 Difference]: Without dead ends: 29 [2022-12-14 09:46:07,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 09:46:07,153 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:46:07,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:46:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-14 09:46:07,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-12-14 09:46:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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-12-14 09:46:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-12-14 09:46:07,191 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2022-12-14 09:46:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:46:07,192 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-12-14 09:46:07,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:46:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-12-14 09:46:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 09:46:07,194 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:46:07,194 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:46:07,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:46:07,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:46:07,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:46:07,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:46:07,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1579182041, now seen corresponding path program 1 times [2022-12-14 09:46:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:46:07,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676136165] [2022-12-14 09:46:07,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:46:07,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:46:07,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:46:07,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:46:07,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 09:46:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:46:07,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:46:07,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:46:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:46:07,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:46:07,655 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:46:07,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676136165] [2022-12-14 09:46:07,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676136165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:46:07,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:46:07,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:46:07,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490810739] [2022-12-14 09:46:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:46:07,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:46:07,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 09:46:07,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:46:07,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:46:07,658 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:46:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:46:07,681 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-12-14 09:46:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:46:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-12-14 09:46:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:46:07,683 INFO L225 Difference]: With dead ends: 54 [2022-12-14 09:46:07,683 INFO L226 Difference]: Without dead ends: 32 [2022-12-14 09:46:07,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-12-14 09:46:07,684 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:46:07,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:46:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-14 09:46:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-12-14 09:46:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-12-14 09:46:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-12-14 09:46:07,689 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2022-12-14 09:46:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:46:07,690 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-12-14 09:46:07,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:46:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-12-14 09:46:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 09:46:07,691 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:46:07,691 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:46:07,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 09:46:07,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:46:07,893 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 09:46:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:46:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1665445247, now seen corresponding path program 1 times [2022-12-14 09:46:07,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 09:46:07,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696909932] [2022-12-14 09:46:07,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:46:07,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 09:46:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 09:46:07,902 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 09:46:07,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 09:46:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:46:08,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 09:46:08,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:46:08,410 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 6 treesize of output 5 [2022-12-14 09:46:08,477 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-12-14 09:46:08,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:46:08,652 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-12-14 09:46:08,716 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-12-14 09:46:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:46:08,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:46:08,854 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 09:46:08,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696909932] [2022-12-14 09:46:08,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696909932] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:46:08,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1674894423] [2022-12-14 09:46:08,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:46:08,855 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 09:46:08,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 09:46:08,857 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 09:46:08,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-12-14 09:46:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:46:09,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 09:46:09,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:46:09,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 8 treesize of output 4 [2022-12-14 09:46:09,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:46:09,518 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-12-14 09:46:09,583 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-12-14 09:46:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:46:09,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:46:09,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1674894423] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:46:09,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984305823] [2022-12-14 09:46:09,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:46:09,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:46:09,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:46:09,677 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:46:09,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c9bc85f4-d039-422e-85ac-6f0d2a2e6c22/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 09:46:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:46:09,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 09:46:09,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:46:10,096 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-12-14 09:46:10,200 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:46:10,200 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 15 treesize of output 21 [2022-12-14 09:46:10,211 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 6 treesize of output 4 [2022-12-14 09:46:10,388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-12-14 09:46:10,392 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 14 treesize of output 11 [2022-12-14 09:46:10,397 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-12-14 09:46:10,404 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 22 treesize of output 18 [2022-12-14 09:46:10,411 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 9 treesize of output 8 [2022-12-14 09:46:10,415 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 8 treesize of output 7 [2022-12-14 09:46:10,481 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 25 treesize of output 17 [2022-12-14 09:46:10,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:46:10,487 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2022-12-14 09:46:10,529 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:46:10,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:46:10,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:46:10,672 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 386 treesize of output 388 [2022-12-14 09:46:10,682 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 496 treesize of output 492 [2022-12-14 09:46:10,709 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 245 treesize of output 243 [2022-12-14 09:46:10,761 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 53 treesize of output 51 [2022-12-14 09:46:10,978 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 177 treesize of output 173 [2022-12-14 09:46:14,596 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse26 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse57 (select (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse58 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse58 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse57 (bvadd (_ bv4 32) v_arrayElimCell_19))) (= (select .cse57 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse34 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_19 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse56 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse56 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) v_arrayElimCell_19))))) (.cse3 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse11 (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (.cse14 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse17 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse55 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse55 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse6) |c_ULTIMATE.start_main_~uneq~0#1|))) (.cse19 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse53 (select (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse54 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse54 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((v_arrayElimCell_17 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse53 (bvadd (_ bv4 32) v_arrayElimCell_17)))) (= (select .cse53 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse21 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse51 (select (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse52 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse52 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse51 (bvadd (_ bv4 32) v_arrayElimCell_16))) (= (select .cse51 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse18 (not .cse14)) (.cse30 (or .cse11 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse49 (select (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse50 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse50 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse49 (bvadd (_ bv4 32) v_arrayElimCell_19))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse49 (bvadd (_ bv4 32) v_arrayElimCell_16)))))))) (.cse33 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse47 (select (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse48 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse48 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse47 (bvadd (_ bv4 32) v_arrayElimCell_19))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse47 (bvadd (_ bv4 32) v_arrayElimCell_16))) (= (select .cse47 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse15 (or .cse11 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse45 (select (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse46 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse46 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 (bvadd (_ bv4 32) v_arrayElimCell_19))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 (bvadd (_ bv4 32) v_arrayElimCell_16))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 (bvadd (_ bv4 32) v_arrayElimCell_17)))))))) (.cse8 (not .cse11)) (.cse27 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse43 (select (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse44 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse44 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse43 (bvadd (_ bv4 32) v_arrayElimCell_19))) (forall ((v_arrayElimCell_17 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse43 (bvadd (_ bv4 32) v_arrayElimCell_17)))) (= (select .cse43 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|))))) (.cse31 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse41 (select (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse42 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 (bvadd (_ bv4 32) v_arrayElimCell_19))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 (bvadd (_ bv4 32) v_arrayElimCell_16))) (= (select .cse41 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 (bvadd (_ bv4 32) v_arrayElimCell_17))))))) (.cse32 (or (and .cse26 (or .cse11 .cse34)) .cse3))) (and (or (and (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse0 (bvadd (_ bv4 32) v_arrayElimCell_18)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_17 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 (bvadd (_ bv4 32) v_arrayElimCell_17))))))) (or .cse3 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) v_arrayElimCell_18)) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_309 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse5 (bvadd (_ bv4 32) v_arrayElimCell_18)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 (bvadd (_ bv4 32) v_arrayElimCell_16))) (= (select .cse5 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 (bvadd (_ bv4 32) v_arrayElimCell_17)))))) (or .cse8 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse10 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse9 (bvadd (_ bv4 32) v_arrayElimCell_18)) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_17 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 (bvadd (_ bv4 32) v_arrayElimCell_17)))) (= (select .cse9 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse11 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= (select .cse12 (bvadd (_ bv4 32) v_arrayElimCell_18)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 (bvadd (_ bv4 32) v_arrayElimCell_16))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 (bvadd (_ bv4 32) v_arrayElimCell_17)))))))) .cse14) .cse15 (or (not .cse3) (and (or (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) v_arrayElimCell_17)))) .cse14) (or .cse8 (and (or .cse17 .cse18) .cse19)) (or (and (or (forall ((v_ArrVal_309 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse20 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse20 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) v_arrayElimCell_16)))) .cse11) .cse21) .cse18) (or .cse11 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse23 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse23 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (bvadd (_ bv4 32) v_arrayElimCell_16))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse22 (bvadd (_ bv4 32) v_arrayElimCell_17))))))) (forall ((v_ArrVal_309 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse25 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse25 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (bvadd (_ bv4 32) v_arrayElimCell_16))) (= (select .cse24 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 (bvadd (_ bv4 32) v_arrayElimCell_17)))))))) (or .cse8 (and (or .cse26 .cse18) .cse27)) (or (and .cse15 (or .cse8 (and (forall ((v_ArrVal_309 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse28 (select (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse29 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (forall ((v_arrayElimCell_17 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (bvadd (_ bv4 32) v_arrayElimCell_17)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 (bvadd (_ bv4 32) v_arrayElimCell_16))) (= (select .cse28 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|)))) .cse17 .cse19 .cse21)) (or .cse8 (and .cse26 .cse27)) .cse30 .cse31 .cse32 .cse33) .cse18) (or .cse18 (and .cse30 .cse33)) (or (and .cse15 (or .cse8 .cse27) (or .cse34 .cse3) .cse31 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse35 (select (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse36 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse36 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 (bvadd (_ bv4 32) v_arrayElimCell_19))) (forall ((v_arrayElimCell_17 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse35 (bvadd (_ bv4 32) v_arrayElimCell_17)))))))) .cse14) .cse31 .cse32 (or .cse14 (and (or .cse11 (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse37 (select (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 (bvadd (_ bv4 32) v_arrayElimCell_19))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 (bvadd (_ bv4 32) v_arrayElimCell_17))))))) (forall ((v_ArrVal_309 (_ BitVec 32)) (v_ArrVal_313 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_307 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32)) (v_ArrVal_317 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse39 (select (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_307)))) (store .cse40 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select .cse40 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_309))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_313) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_317) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 (bvadd (_ bv4 32) v_arrayElimCell_19))) (= (select .cse39 .cse6) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse39 (bvadd (_ bv4 32) v_arrayElimCell_17)))))))))))) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem10#1.base| (_ bv0 32)))) is different from true [2022-12-14 09:52:50,853 WARN L233 SmtUtils]: Spent 6.09m on a formula simplification. DAG size of input: 140 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)