./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI --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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:57:11,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:57:11,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:57:11,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:57:11,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:57:11,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:57:11,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:57:11,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:57:11,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:57:11,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:57:11,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:57:11,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:57:11,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:57:11,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:57:11,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:57:11,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:57:11,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:57:11,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:57:11,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:57:11,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:57:11,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:57:11,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:57:11,577 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:57:11,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:57:11,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:57:11,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:57:11,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:57:11,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:57:11,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:57:11,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:57:11,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:57:11,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:57:11,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:57:11,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:57:11,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:57:11,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:57:11,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:57:11,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:57:11,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:57:11,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:57:11,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:57:11,597 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:57:11,623 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:57:11,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:57:11,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:57:11,624 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:57:11,625 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:57:11,625 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:57:11,625 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:57:11,625 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:57:11,626 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:57:11,626 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:57:11,626 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:57:11,626 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:57:11,627 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:57:11,627 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:57:11,627 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:57:11,627 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:57:11,628 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:57:11,628 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:57:11,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:57:11,629 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:57:11,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:57:11,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:57:11,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:57:11,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:57:11,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:57:11,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:57:11,631 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:57:11,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:57:11,631 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:57:11,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:57:11,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:57:11,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:57:11,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:57:11,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:57:11,633 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:57:11,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:57:11,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:57:11,633 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:57:11,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:57:11,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:57:11,634 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:57:11,634 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_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2022-11-03 03:57:11,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:57:11,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:57:11,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:57:11,983 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:57:11,984 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:57:11,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-03 03:57:12,065 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/data/01f965627/6ad4f0ddf312417284fa20bd48686278/FLAG37cb98dd2 [2022-11-03 03:57:12,633 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:57:12,634 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-03 03:57:12,653 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/data/01f965627/6ad4f0ddf312417284fa20bd48686278/FLAG37cb98dd2 [2022-11-03 03:57:12,915 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/data/01f965627/6ad4f0ddf312417284fa20bd48686278 [2022-11-03 03:57:12,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:57:12,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:57:12,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:57:12,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:57:12,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:57:12,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:57:12" (1/1) ... [2022-11-03 03:57:12,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e53ed05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:12, skipping insertion in model container [2022-11-03 03:57:12,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:57:12" (1/1) ... [2022-11-03 03:57:12,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:57:12,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:57:13,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-03 03:57:13,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:57:13,385 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:57:13,460 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-03 03:57:13,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:57:13,495 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:57:13,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13 WrapperNode [2022-11-03 03:57:13,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:57:13,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:57:13,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:57:13,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:57:13,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13" (1/1) ... [2022-11-03 03:57:13,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13" (1/1) ... [2022-11-03 03:57:13,578 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2022-11-03 03:57:13,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:57:13,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:57:13,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:57:13,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:57:13,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13" (1/1) ... [2022-11-03 03:57:13,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13" (1/1) ... [2022-11-03 03:57:13,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13" (1/1) ... [2022-11-03 03:57:13,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13" (1/1) ... [2022-11-03 03:57:13,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13" (1/1) ... [2022-11-03 03:57:13,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13" (1/1) ... [2022-11-03 03:57:13,618 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13" (1/1) ... [2022-11-03 03:57:13,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13" (1/1) ... [2022-11-03 03:57:13,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:57:13,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:57:13,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:57:13,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:57:13,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13" (1/1) ... [2022-11-03 03:57:13,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:57:13,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:13,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:57:13,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:57:13,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:57:13,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:57:13,742 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-03 03:57:13,742 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-03 03:57:13,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:57:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:57:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:57:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 03:57:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 03:57:13,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:57:13,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 03:57:13,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:57:13,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:57:13,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:57:13,879 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:57:13,881 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:57:14,225 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:57:14,265 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:57:14,266 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 03:57:14,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:57:14 BoogieIcfgContainer [2022-11-03 03:57:14,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:57:14,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:57:14,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:57:14,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:57:14,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:57:12" (1/3) ... [2022-11-03 03:57:14,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fec6b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:57:14, skipping insertion in model container [2022-11-03 03:57:14,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:13" (2/3) ... [2022-11-03 03:57:14,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fec6b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:57:14, skipping insertion in model container [2022-11-03 03:57:14,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:57:14" (3/3) ... [2022-11-03 03:57:14,286 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-11-03 03:57:14,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:57:14,312 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:57:14,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:57:14,391 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;@4f7dca64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:57:14,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 03:57:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:57:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 03:57:14,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:14,409 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:57:14,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:57:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:14,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1098954130, now seen corresponding path program 1 times [2022-11-03 03:57:14,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:14,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966110328] [2022-11-03 03:57:14,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:14,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:57:14,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:14,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966110328] [2022-11-03 03:57:14,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966110328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:14,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:14,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:57:14,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907051137] [2022-11-03 03:57:14,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:14,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:57:14,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:14,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:57:14,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:57:14,903 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:57:14,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:14,985 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-11-03 03:57:14,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:57:14,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 17 [2022-11-03 03:57:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:14,995 INFO L225 Difference]: With dead ends: 53 [2022-11-03 03:57:14,996 INFO L226 Difference]: Without dead ends: 25 [2022-11-03 03:57:14,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:57:15,005 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 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.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:15,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:57:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-03 03:57:15,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-11-03 03:57:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:57:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-11-03 03:57:15,041 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 17 [2022-11-03 03:57:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:15,041 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-11-03 03:57:15,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 03:57:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-11-03 03:57:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:57:15,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:15,044 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:57:15,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:57:15,044 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:57:15,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:15,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1272861567, now seen corresponding path program 1 times [2022-11-03 03:57:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:15,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912931326] [2022-11-03 03:57:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:57:15,885 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:15,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912931326] [2022-11-03 03:57:15,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912931326] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:15,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394764155] [2022-11-03 03:57:15,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:15,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:15,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:15,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:57:15,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:57:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:16,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 03:57:16,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:16,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-03 03:57:16,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:16,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-03 03:57:16,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 03:57:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:57:16,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:16,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_12| Int) (v_ArrVal_184 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_12| v_ArrVal_184) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_12| |c_#StackHeapBarrier|)))) is different from false [2022-11-03 03:57:16,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394764155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:16,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1626063249] [2022-11-03 03:57:16,614 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-03 03:57:16,614 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:57:16,618 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:57:16,624 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:57:16,632 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:57:16,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:16,707 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:57:16,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-03 03:57:16,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:16,742 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:57:16,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 03:57:16,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:57:16,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:57:16,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:16,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:16,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:16,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:16,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:16,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:57:16,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:16,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:57:16,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:16,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:57:16,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:16,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:57:16,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:17,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:57:17,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:17,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:17,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:17,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 03:57:17,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:17,650 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:17,652 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:17,654 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:17,660 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:17,663 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:18,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:18,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:18,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:18,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:18,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:18,171 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:18,173 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:18,175 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:18,179 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:18,181 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:18,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:18,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:57:18,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:57:18,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:57:18,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:18,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 124 [2022-11-03 03:57:18,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:18,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-03 03:57:18,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:18,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2022-11-03 03:57:18,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 03:57:18,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:57:18,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:57:18,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:18,964 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:18,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:57:18,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:18,992 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:18,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:57:19,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:19,125 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:19,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:57:19,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:19,145 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:19,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:57:19,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 168 [2022-11-03 03:57:19,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:19,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 168 [2022-11-03 03:57:19,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:19,371 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 03:57:19,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 180 [2022-11-03 03:57:19,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:19,409 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 03:57:19,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 197 treesize of output 172 [2022-11-03 03:57:19,633 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 20 for LOIs [2022-11-03 03:57:19,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:57:19,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:57:19,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:19,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:57:19,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:19,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:19,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:19,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:19,710 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:57:23,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1626063249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:23,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:57:23,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13, 13] total 34 [2022-11-03 03:57:23,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034286269] [2022-11-03 03:57:23,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:23,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 03:57:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:23,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 03:57:23,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1076, Unknown=1, NotChecked=66, Total=1260 [2022-11-03 03:57:23,935 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:57:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:24,396 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-11-03 03:57:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:57:24,397 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 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 23 [2022-11-03 03:57:24,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:24,398 INFO L225 Difference]: With dead ends: 34 [2022-11-03 03:57:24,398 INFO L226 Difference]: Without dead ends: 32 [2022-11-03 03:57:24,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=117, Invalid=1076, Unknown=1, NotChecked=66, Total=1260 [2022-11-03 03:57:24,400 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:24,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 60 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:57:24,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-03 03:57:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-11-03 03:57:24,409 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-11-03 03:57:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-11-03 03:57:24,410 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 23 [2022-11-03 03:57:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:24,411 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-11-03 03:57:24,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:57:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-11-03 03:57:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:57:24,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:24,412 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:57:24,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:24,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:24,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:57:24,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash -843775883, now seen corresponding path program 1 times [2022-11-03 03:57:24,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:24,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061061145] [2022-11-03 03:57:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:57:25,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:25,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061061145] [2022-11-03 03:57:25,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061061145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:25,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592129241] [2022-11-03 03:57:25,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:25,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:25,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:25,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:57:25,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:57:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:25,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 03:57:25,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:25,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-03 03:57:25,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-03 03:57:25,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 03:57:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:57:25,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:25,571 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#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_append_#t~ret9#1.base_16| v_ArrVal_320) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| |c_#StackHeapBarrier|)))) is different from false [2022-11-03 03:57:25,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592129241] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:25,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1675616055] [2022-11-03 03:57:25,575 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-03 03:57:25,576 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:57:25,576 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:57:25,576 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:57:25,577 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:57:25,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,614 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:57:25,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 03:57:25,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 03:57:25,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:57:25,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:57:25,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:25,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:57:25,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:25,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:57:25,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:57:25,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:57:25,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:25,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:57:26,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:26,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:26,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:26,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:26,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:26,108 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:26,111 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:26,112 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:26,115 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:26,117 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:26,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 03:57:26,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:26,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:26,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:26,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:26,329 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:26,331 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:26,332 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:26,334 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:26,337 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:26,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:57:26,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:26,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:57:26,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:57:26,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:26,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 124 [2022-11-03 03:57:26,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:26,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-03 03:57:26,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:26,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120 [2022-11-03 03:57:26,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:57:26,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 03:57:26,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:57:26,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:26,920 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:26,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:57:26,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:26,937 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:26,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:57:27,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:27,055 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:27,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:57:27,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:27,074 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:27,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:57:27,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:27,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 166 [2022-11-03 03:57:27,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:27,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 166 [2022-11-03 03:57:27,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:27,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:27,268 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 03:57:27,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 176 [2022-11-03 03:57:27,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:27,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:27,303 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 03:57:27,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 168 [2022-11-03 03:57:27,588 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 20 for LOIs [2022-11-03 03:57:27,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:57:27,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:57:27,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:27,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:57:27,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:27,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:27,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:27,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:27,644 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:57:32,631 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '467#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~count~0#1| 1) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#res#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|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_#in~data#1| |ULTIMATE.start_main_~data~0#1|) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= (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_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| |ULTIMATE.start_sll_circular_append_~data#1|) (<= 0 |#NULL.offset|) (= (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_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (< |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 03:57:32,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:57:32,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:57:32,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-11-03 03:57:32,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414975798] [2022-11-03 03:57:32,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:57:32,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 03:57:32,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:32,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 03:57:32,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1205, Unknown=1, NotChecked=70, Total=1406 [2022-11-03 03:57:32,634 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 03:57:32,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:32,921 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-11-03 03:57:32,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:57:32,922 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2022-11-03 03:57:32,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:32,923 INFO L225 Difference]: With dead ends: 33 [2022-11-03 03:57:32,924 INFO L226 Difference]: Without dead ends: 24 [2022-11-03 03:57:32,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=163, Invalid=1562, Unknown=1, NotChecked=80, Total=1806 [2022-11-03 03:57:32,925 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:32,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 166 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 156 Invalid, 0 Unknown, 18 Unchecked, 0.2s Time] [2022-11-03 03:57:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-03 03:57:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-11-03 03:57:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:57:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-11-03 03:57:32,934 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 25 [2022-11-03 03:57:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:32,934 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-11-03 03:57:32,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-03 03:57:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-11-03 03:57:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:57:32,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:32,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:57:32,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:33,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:33,149 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:57:33,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:33,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1512516796, now seen corresponding path program 1 times [2022-11-03 03:57:33,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:33,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759811692] [2022-11-03 03:57:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:33,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:34,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:34,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759811692] [2022-11-03 03:57:34,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759811692] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:34,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38606793] [2022-11-03 03:57:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:34,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:34,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:34,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:57:34,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:57:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:34,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-03 03:57:34,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:34,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:57:34,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:34,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:34,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 03:57:34,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:34,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:57:34,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:57:34,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:34,981 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 03:57:34,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-03 03:57:35,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:57:35,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 03:57:35,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-11-03 03:57:35,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:35,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:57:35,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:35,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:35,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:35,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 03:57:35,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:35,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-03 03:57:35,638 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 03:57:35,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-03 03:57:35,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:35,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:35,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:35,678 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-03 03:57:35,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2022-11-03 03:57:36,011 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 03:57:36,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 62 [2022-11-03 03:57:36,040 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-03 03:57:36,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 89 [2022-11-03 03:57:36,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:36,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-03 03:57:36,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:36,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-03 03:57:36,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:57:36,180 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 03:57:36,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 27 [2022-11-03 03:57:36,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:57:36,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:57:36,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:57:36,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:36,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_475 Int) (v_ArrVal_480 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_475)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_480) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_473) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-03 03:57:36,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_475 Int) (v_ArrVal_480 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| Int) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| v_ArrVal_475)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_480) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_473) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) is different from false [2022-11-03 03:57:36,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_475 Int) (v_ArrVal_480 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| Int) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| v_ArrVal_475)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_480) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_473) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_478) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|))) is different from false [2022-11-03 03:57:36,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_475 Int) (v_ArrVal_490 (Array Int Int)) (v_ArrVal_492 (Array Int Int)) (v_ArrVal_491 (Array Int Int)) (v_ArrVal_480 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| Int) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_492))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_490))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_491))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| v_ArrVal_475))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_480) (select (select (store (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_477) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse3 .cse1 v_ArrVal_473) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_478) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|) 0)) (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) is different from false [2022-11-03 03:57:36,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38606793] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:36,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [147552871] [2022-11-03 03:57:36,595 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-03 03:57:36,595 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:57:36,596 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:57:36,596 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:57:36,596 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:57:36,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:36,626 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:57:36,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 03:57:36,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:36,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 03:57:36,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:57:36,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:57:36,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:36,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:36,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:36,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:36,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:36,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:57:36,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:36,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:57:36,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:36,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:57:36,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:36,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:57:36,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:36,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:57:36,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:36,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:36,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:36,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:36,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:36,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:36,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:36,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:36,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:36,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:37,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:57:37,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:57:37,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:57:37,348 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:37,350 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:37,351 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:37,354 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:37,356 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:37,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:37,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:37,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:37,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:37,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:37,588 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:37,591 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:37,592 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:37,595 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:37,597 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:37,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:37,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:37,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:37,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:37,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:37,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:57:37,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:37,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:57:37,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:57:38,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:38,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:38,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:38,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:38,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:38,170 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:38,172 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:38,174 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:38,176 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:38,178 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:38,407 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:38,409 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:38,410 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:38,413 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:38,418 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:38,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:38,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:38,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:38,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:38,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:38,557 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:57:38,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:57:38,588 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:57:38,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:57:38,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:57:38,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:38,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:38,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:38,694 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:38,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:57:38,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:38,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:38,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:38,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:38,744 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:38,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:57:38,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:38,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:38,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:38,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:38,850 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:38,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:57:38,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:38,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:38,887 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:38,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:57:38,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:39,097 INFO L356 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2022-11-03 03:57:39,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 34 [2022-11-03 03:57:39,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:39,198 INFO L356 Elim1Store]: treesize reduction 120, result has 19.5 percent of original size [2022-11-03 03:57:39,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 119 treesize of output 112 [2022-11-03 03:57:39,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:39,322 INFO L356 Elim1Store]: treesize reduction 95, result has 36.2 percent of original size [2022-11-03 03:57:39,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 119 treesize of output 137 [2022-11-03 03:57:39,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:39,438 INFO L356 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-03 03:57:39,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 45 [2022-11-03 03:57:39,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:39,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:39,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 03:57:39,536 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:39,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:39,616 INFO L356 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-03 03:57:39,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 53 [2022-11-03 03:57:39,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:39,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:39,695 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:57:39,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 23 [2022-11-03 03:57:39,718 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:57:39,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-03 03:57:39,743 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:40,856 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2022-11-03 03:57:40,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:57:40,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:57:40,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:40,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:40,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:40,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:40,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:40,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:57:40,899 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:57:40,918 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse33 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (let ((.cse3 (not .cse33))) (and (< 0 |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (.cse5 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse0 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse11 (= .cse10 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (.cse12 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse16 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse32 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8))) (let ((.cse30 (select (select .cse32 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse31 (select .cse32 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= .cse30 .cse5) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse30) (= .cse30 (select v_DerPreprocessor_8 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= (select .cse31 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (= .cse31 v_DerPreprocessor_7)))))) (.cse2 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse17)) (.cse9 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (or (let ((.cse8 (not .cse12)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (and (or .cse0 (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse1 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) .cse2 .cse3) .cse4 (let ((.cse6 (not (= .cse17 0)))) (or (and (or (not (= .cse5 0)) .cse6) (or (and (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) .cse3) (= (select .cse7 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) .cse8) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse5) .cse9 (= .cse10 .cse5)) (and .cse0 .cse11 .cse12 .cse9 (or (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse15 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse14 (select .cse15 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= .cse13 .cse5) (not (= .cse13 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse13) (= .cse13 (select v_DerPreprocessor_8 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= (select .cse14 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (= .cse14 v_DerPreprocessor_7))))) (and .cse16 .cse6))))) (or (not .cse0) .cse8) (or (and .cse0 .cse12) (= (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) .cse17)) (= .cse17 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and .cse4 .cse0 .cse11 .cse12 (or (and (or (exists ((v_DerPreprocessor_10 (Array Int Int))) (let ((.cse18 (select v_DerPreprocessor_10 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (and (= .cse18 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_9 (Array Int Int))) (let ((.cse20 (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse19 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse19 v_DerPreprocessor_9) (= .cse18 (select (select .cse20 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (not (= .cse18 0))))) (exists ((v_DerPreprocessor_10 (Array Int Int))) (let ((.cse21 (select v_DerPreprocessor_10 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (and (= .cse21 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (not (= .cse21 0)) (exists ((v_DerPreprocessor_9 (Array Int Int))) (let ((.cse22 (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse22 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse22 v_DerPreprocessor_9)))))))) .cse16) (and (exists ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (let ((.cse25 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4))) (let ((.cse23 (select (select .cse25 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse24 (select .cse25 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= .cse23 .cse5) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse23) (= .cse24 v_prenex_3) (= .cse23 (select v_prenex_4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (not (= .cse23 0)) (= (select .cse24 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))) (or (exists ((v_DerPreprocessor_10 (Array Int Int))) (let ((.cse26 (select v_DerPreprocessor_10 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (and (= .cse26 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_9 (Array Int Int))) (let ((.cse28 (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10))) (let ((.cse27 (select .cse28 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse27 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse27 v_DerPreprocessor_9) (= .cse26 (select (select .cse28 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))))))) (exists ((v_DerPreprocessor_10 (Array Int Int))) (and (= (select v_DerPreprocessor_10 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_9 (Array Int Int))) (let ((.cse29 (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse29 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse29 v_DerPreprocessor_9))))))))) .cse2 .cse9))))) (<= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (< |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_#NULL.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#in~data#1| |c_ULTIMATE.start_sll_circular_append_~data#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_sll_circular_create_~data#1|) (<= 1 |c_ULTIMATE.start_sll_circular_append_~data#1|) (<= 1 |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (= (+ |c_ULTIMATE.start_sll_circular_create_~len#1| 1) |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= 2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_#NULL.base| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |c_ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) .cse3) (= |c_ULTIMATE.start_main_~ptr~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (<= |c_ULTIMATE.start_sll_circular_append_~data#1| 1) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (or (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4) .cse33) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_sll_circular_append_~data#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 8) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (< |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |c_ULTIMATE.start_sll_circular_create_~len#1| 1) (= |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from true [2022-11-03 03:57:50,340 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '721#(and (<= |ULTIMATE.start_sll_circular_append_~data#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 1 |ULTIMATE.start_sll_circular_append_#in~data#1|) (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_#res#1.offset|) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (or (and (exists ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (and (= v_prenex_3 (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (not (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select v_prenex_4 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_prenex_3) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_prenex_4) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (or (exists ((v_DerPreprocessor_10 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select v_DerPreprocessor_10 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (exists ((v_DerPreprocessor_9 (Array Int Int))) (and (= v_DerPreprocessor_9 (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) (exists ((v_DerPreprocessor_10 (Array Int Int))) (and (exists ((v_DerPreprocessor_9 (Array Int Int))) (and (= v_DerPreprocessor_9 (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select v_DerPreprocessor_10 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select v_DerPreprocessor_10 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select v_DerPreprocessor_8 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) v_DerPreprocessor_7))) (or (exists ((v_DerPreprocessor_10 (Array Int Int))) (and (exists ((v_DerPreprocessor_9 (Array Int Int))) (and (= v_DerPreprocessor_9 (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select v_DerPreprocessor_10 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select v_DerPreprocessor_10 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (not (= (select v_DerPreprocessor_10 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) 0)))) (exists ((v_DerPreprocessor_10 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select v_DerPreprocessor_10 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (exists ((v_DerPreprocessor_9 (Array Int Int))) (and (= v_DerPreprocessor_9 (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_9) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_10) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (not (= (select v_DerPreprocessor_10 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) 0))))))) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) (or (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) 0)) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select v_DerPreprocessor_8 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) v_DerPreprocessor_7)))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (and (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (not (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select v_DerPreprocessor_8 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_8) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) v_DerPreprocessor_7))))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) 0))) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (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) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_append_~data#1|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (not (= 2 |ULTIMATE.start_main_~#s~0#1.base|)) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_#in~data#1| |ULTIMATE.start_main_~data~0#1|) (not (= |ULTIMATE.start_main_~#s~0#1.base| 0)) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |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_sll_circular_create_~head~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) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (or (= |ULTIMATE.start_sll_circular_append_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4)) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4))) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_append_#in~data#1| |ULTIMATE.start_sll_circular_append_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (< |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|) (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 03:57:50,341 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:57:50,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:57:50,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2022-11-03 03:57:50,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956212938] [2022-11-03 03:57:50,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:57:50,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 03:57:50,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:50,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 03:57:50,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=3100, Unknown=21, NotChecked=580, Total=3906 [2022-11-03 03:57:50,345 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 03:57:51,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:51,990 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-11-03 03:57:51,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 03:57:51,992 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2022-11-03 03:57:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:51,993 INFO L225 Difference]: With dead ends: 67 [2022-11-03 03:57:51,993 INFO L226 Difference]: Without dead ends: 59 [2022-11-03 03:57:51,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=335, Invalid=5064, Unknown=23, NotChecked=740, Total=6162 [2022-11-03 03:57:51,996 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:51,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 414 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 591 Invalid, 0 Unknown, 100 Unchecked, 0.6s Time] [2022-11-03 03:57:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-03 03:57:52,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2022-11-03 03:57:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 03:57:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-11-03 03:57:52,012 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 26 [2022-11-03 03:57:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:52,013 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-11-03 03:57:52,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 03:57:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-11-03 03:57:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 03:57:52,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:52,014 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] [2022-11-03 03:57:52,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-03 03:57:52,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:52,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:57:52,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:52,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1387928183, now seen corresponding path program 1 times [2022-11-03 03:57:52,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:52,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661123962] [2022-11-03 03:57:52,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:52,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:57:54,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:54,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661123962] [2022-11-03 03:57:54,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661123962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:54,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289375092] [2022-11-03 03:57:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:54,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:54,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:54,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:57:54,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:57:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:55,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 150 conjunts are in the unsatisfiable core [2022-11-03 03:57:55,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:55,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:57:55,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:55,414 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:57:55,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:57:55,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:57:55,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:57:55,666 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0)))) is different from false [2022-11-03 03:57:55,669 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0)))) is different from true [2022-11-03 03:57:55,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:57:55,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:57:55,729 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4)) (< |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|)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)))) is different from false [2022-11-03 03:57:55,732 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4)) (< |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|)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)))) is different from true [2022-11-03 03:57:55,760 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 03:57:55,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2022-11-03 03:57:55,795 INFO L356 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-03 03:57:55,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 44 [2022-11-03 03:57:55,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:55,832 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 4))) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_41| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_41| .cse0) 1)))))) is different from false [2022-11-03 03:57:55,835 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 4))) (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_41| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_41| .cse0) 1)))))) is different from true [2022-11-03 03:57:55,857 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:55,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 34 [2022-11-03 03:57:55,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:57:55,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:55,909 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_80| .cse0)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from false [2022-11-03 03:57:55,912 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_80| .cse0)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) is different from true [2022-11-03 03:57:55,958 WARN L833 $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_old(#memory_int)| |c_#memory_int|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_80| .cse0)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |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)) is different from false [2022-11-03 03:57:55,961 WARN L855 $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_old(#memory_int)| |c_#memory_int|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_80| .cse0)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |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)) is different from true [2022-11-03 03:57:56,020 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_645 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_645) |c_#memory_int|)) (exists ((v_ArrVal_646 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_646) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_647 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_647))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_80| .cse0)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1)))) is different from false [2022-11-03 03:57:56,023 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_645 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_645) |c_#memory_int|)) (exists ((v_ArrVal_646 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_646) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_647 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_647))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_80| .cse0)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1)))) is different from true [2022-11-03 03:57:56,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:56,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 03:57:56,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:56,082 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 03:57:56,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 65 [2022-11-03 03:57:56,099 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 03:57:56,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 44 [2022-11-03 03:57:56,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:56,184 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (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| .cse0) 0)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) (and (or (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse0) (= .cse1 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (<= .cse3 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_old(#valid)_AFTER_CALL_42| .cse4)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-11-03 03:57:56,188 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (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| .cse0) 0)) (.cse3 (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) (and (or (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse0) (= .cse1 .cse0) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (<= .cse3 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_old(#valid)_AFTER_CALL_42| .cse4)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-11-03 03:57:56,303 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (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) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= .cse3 .cse2) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 4))) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_old(#valid)_AFTER_CALL_42| .cse4)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse3))))))) is different from false [2022-11-03 03:57:56,307 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (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) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= .cse3 .cse2) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 4))) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_old(#valid)_AFTER_CALL_42| .cse4)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse3))))))) is different from true [2022-11-03 03:57:56,448 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (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) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= .cse3 .cse2) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 4))) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_old(#valid)_AFTER_CALL_42| .cse4)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse3))))))) is different from false [2022-11-03 03:57:56,453 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (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) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2) (= .cse3 .cse2) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 4))) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_old(#valid)_AFTER_CALL_42| .cse4)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse3))))))) is different from true [2022-11-03 03:57:56,578 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (and (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse2) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3) (= .cse4 .cse3) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 4))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse3) (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse5 (select |v_old(#valid)_AFTER_CALL_42| .cse5)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse4))))))) is different from false [2022-11-03 03:57:56,582 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (and (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse2) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3) (= .cse4 .cse3) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 4))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse3) (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse5 (select |v_old(#valid)_AFTER_CALL_42| .cse5)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse4))))))) is different from true [2022-11-03 03:57:56,700 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse5 0))) (and (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3) (= .cse4 .cse3) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 4))) (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select .cse5 .cse2) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_old(#valid)_AFTER_CALL_42| .cse6)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse4)))))))) is different from false [2022-11-03 03:57:56,704 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select .cse5 0))) (and (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= .cse2 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3) (= .cse4 .cse3) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 4))) (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select .cse5 .cse2) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse6 (select |v_old(#valid)_AFTER_CALL_42| .cse6)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse4)))))))) is different from true [2022-11-03 03:57:57,046 INFO L356 Elim1Store]: treesize reduction 107, result has 17.1 percent of original size [2022-11-03 03:57:57,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 175 treesize of output 97 [2022-11-03 03:57:57,131 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-03 03:57:57,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 169 [2022-11-03 03:57:57,170 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 03:57:57,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 249 treesize of output 198 [2022-11-03 03:57:57,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:57,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:57,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:57,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 80 [2022-11-03 03:57:57,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:57,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:57,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 03:57:57,383 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (= (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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 4)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_253 Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse2 (+ 2 .cse5))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_43| .cse1) 0) (<= .cse2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_80| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_old(#valid)_AFTER_CALL_42| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1)))))))) is different from false [2022-11-03 03:57:57,387 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0))) (and (= (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) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 4)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_253 Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse2 (+ 2 .cse5))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_43| .cse1) 0) (<= .cse2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse3 (select |v_#valid_BEFORE_CALL_80| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) 0) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse4 (select |v_old(#valid)_AFTER_CALL_42| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_42| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse0)) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1)))))))) is different from true [2022-11-03 03:57:57,436 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-03 03:57:57,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 58 [2022-11-03 03:57:57,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:57:57,555 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_271 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_253 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimCell_271))) (and (not (= v_arrayElimIndex_14 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_80| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_80| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimIndex_14) 1) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_old(#valid)_AFTER_CALL_42| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_271) 0) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))))) is different from false [2022-11-03 03:57:57,559 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_271 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_253 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse1 (+ 2 v_arrayElimCell_271))) (and (not (= v_arrayElimIndex_14 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_80| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_80| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimIndex_14) 1) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse1 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse2 (select |v_old(#valid)_AFTER_CALL_42| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_271) 0) (<= .cse1 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))))) is different from true [2022-11-03 03:57:57,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:57:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2022-11-03 03:57:57,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:57,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_656) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_655) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-03 03:57:57,745 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| Int) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_656) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_655) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-03 03:57:57,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| Int) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_656) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_655) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-03 03:57:57,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| Int) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_656) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_655) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_653) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-03 03:57:57,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| Int) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_653 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_669)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_667))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_668) .cse0 v_ArrVal_656) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_655) (select (select (store (store .cse1 .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_653) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store .cse2 .cse0 (store (select .cse2 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_13| 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_654) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| |c_#StackHeapBarrier|)))) is different from false [2022-11-03 03:57:57,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289375092] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:57,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1664264381] [2022-11-03 03:57:57,912 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-03 03:57:57,913 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:57:57,913 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:57:57,913 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:57:57,914 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:57:57,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:57,941 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:57:57,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-03 03:57:57,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:57,968 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:57:57,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 03:57:57,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:57:57,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:57:58,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:58,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:57:58,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:58,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:58,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:58,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:57:58,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:58,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:57:58,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:58,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:57:58,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:58,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:57:58,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:58,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:57:58,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:58,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:58,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:58,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:58,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:58,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:58,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:58,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:58,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:58,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:58,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:58,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:57:58,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:57:58,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:57:58,588 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:58,590 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:58,592 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:58,594 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:58,597 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:58,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:58,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:58,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:58,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:58,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:58,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:58,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:58,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:58,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:58,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:58,886 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:58,888 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:58,889 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:58,892 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:58,894 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:58,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:57:58,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:57:58,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:58,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:57:59,280 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:59,283 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:59,284 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:59,286 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:59,288 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:59,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:59,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:59,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:59,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:59,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:59,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:59,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:59,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:59,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:59,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:59,601 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:59,603 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:59,604 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:59,606 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:59,608 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:57:59,677 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:57:59,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:57:59,703 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:57:59,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:57:59,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:57:59,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:59,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:59,787 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:59,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:57:59,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:59,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:59,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:59,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:59,862 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:59,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:57:59,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:57:59,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:57:59,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:59,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:59,958 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:59,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:57:59,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:59,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:59,984 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:57:59,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:00,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:00,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:00,198 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-03 03:58:00,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-03 03:58:00,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:00,288 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:58:00,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:58:00,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:00,374 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-03 03:58:00,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-03 03:58:00,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:00,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:00,496 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:58:00,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:58:00,573 INFO L356 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-03 03:58:00,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-03 03:58:00,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:00,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:00,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:58:00,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-03 03:58:00,688 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:58:00,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-03 03:58:00,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:00,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 03:58:00,715 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:01,185 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 03:58:01,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:58:01,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:58:01,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:01,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:01,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:01,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:58:01,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:01,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:01,223 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:58:08,274 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1089#(and (<= |ULTIMATE.start_sll_circular_append_~data#1| 1) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_sll_circular_append_#in~data#1|) (or (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (and (= (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_16) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_17) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_16) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_17) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) v_DerPreprocessor_16) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_16) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_17) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_16) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_17) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_append_~data#1|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (exists ((v_DerPreprocessor_15 (Array Int Int))) (and (exists ((v_DerPreprocessor_14 (Array Int Int))) (and (= v_DerPreprocessor_14 (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_14) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_15) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_14) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_15) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_14) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_15) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_14) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_15) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_14) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_15) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_14) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_15) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_DerPreprocessor_15 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (and (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (and (= v_DerPreprocessor_14 (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_14) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_15) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_14) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_15) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_14) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_15) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_14) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_15) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_DerPreprocessor_15 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))))) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-03 03:58:08,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:58:08,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:58:08,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2022-11-03 03:58:08,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924154127] [2022-11-03 03:58:08,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:08,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-03 03:58:08,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:58:08,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-03 03:58:08,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2205, Unknown=44, NotChecked=1998, Total=4422 [2022-11-03 03:58:08,277 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 42 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 03:58:08,938 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_create_~data#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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0)))) is different from false [2022-11-03 03:58:08,941 WARN L855 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 4)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (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) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_create_~data#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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0)))) is different from true [2022-11-03 03:58:08,946 WARN L833 $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 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))))) is different from false [2022-11-03 03:58:08,949 WARN L855 $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 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))))) is different from true [2022-11-03 03:58:08,955 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse4 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 4))) (.cse3 (select .cse6 0)) (.cse0 (select .cse6 .cse1))) (and (not (= .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= .cse1 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 .cse2)) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= .cse3 .cse2) .cse4) (= (select |c_#valid| .cse2) 1) .cse4 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_41| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_41| .cse3) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1)) 0))))) is different from false [2022-11-03 03:58:08,957 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse4 (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 4))) (.cse3 (select .cse6 0)) (.cse0 (select .cse6 .cse1))) (and (not (= .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse0) 1) (= .cse1 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse0 .cse2)) (not (= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (= .cse3 .cse2) .cse4) (= (select |c_#valid| .cse2) 1) .cse4 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_41| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_41| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_41| .cse3) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1)) 0))))) is different from true [2022-11-03 03:58:08,965 WARN L833 $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_old(#memory_int)| |c_#memory_int|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_80| .cse0)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2022-11-03 03:58:08,967 WARN L855 $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_old(#memory_int)| |c_#memory_int|) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse0 (select |v_#valid_BEFORE_CALL_80| .cse0)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2022-11-03 03:58:08,975 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse4 (store |c_old(#memory_int)| .cse0 (select |c_#memory_int| .cse0)))) (let ((.cse2 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (.cse3 (@diff .cse4 |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse5 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse6 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or (= |c_old(#memory_int)| |c_#memory_int|) (= (select |c_old(#valid)| .cse0) 0)) (or (= (select |c_old(#valid)| .cse1) 0) .cse2) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_645 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_645) |c_#memory_int|)) (or .cse2 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse3) 0) (= .cse4 |c_#memory_int|)) (exists ((v_ArrVal_646 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_646) |c_#memory_$Pointer$.offset|)) (= (store .cse4 .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse5 (= (select |c_old(#valid)| .cse6) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse6 (select |c_#memory_$Pointer$.base| .cse6))) (or .cse5 (<= (+ .cse6 1) |c_#StackHeapBarrier|)) (exists ((v_ArrVal_647 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_647))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_80| .cse7)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|))))) is different from false [2022-11-03 03:58:08,982 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_int)| |c_#memory_int|))) (let ((.cse4 (store |c_old(#memory_int)| .cse0 (select |c_#memory_int| .cse0)))) (let ((.cse2 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (.cse3 (@diff .cse4 |c_#memory_int|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse5 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse6 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (or (= |c_old(#memory_int)| |c_#memory_int|) (= (select |c_old(#valid)| .cse0) 0)) (or (= (select |c_old(#valid)| .cse1) 0) .cse2) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((v_ArrVal_645 (Array Int Int))) (= (store |c_old(#memory_int)| |c_node_create_#res#1.base| v_ArrVal_645) |c_#memory_int|)) (or .cse2 (<= (+ .cse1 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse3) 0) (= .cse4 |c_#memory_int|)) (exists ((v_ArrVal_646 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_646) |c_#memory_$Pointer$.offset|)) (= (store .cse4 .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse5 (= (select |c_old(#valid)| .cse6) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse6 (select |c_#memory_$Pointer$.base| .cse6))) (or .cse5 (<= (+ .cse6 1) |c_#StackHeapBarrier|)) (exists ((v_ArrVal_647 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_647))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse7 (select |v_#valid_BEFORE_CALL_80| .cse7)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (< |c_#StackHeapBarrier| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|))))) is different from true [2022-11-03 03:58:09,000 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse9 (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (.cse6 (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse4 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse1) (= .cse2 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 4))) (not (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_80| .cse5)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (<= .cse6 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_old(#valid)_AFTER_CALL_42| .cse7)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse4)) (= (select (select |c_#memory_$Pointer$.offset| .cse3) (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) is different from false [2022-11-03 03:58:09,005 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse9 (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (.cse6 (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse4 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse8) .cse9))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (or (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse1) (= .cse2 .cse1) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse1) 4))) (not (= .cse3 .cse4)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (= |v_#valid_BEFORE_CALL_80| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse5 (select |v_#valid_BEFORE_CALL_80| .cse5)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (<= .cse6 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| .cse3)) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse1) 1) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_old(#valid)_AFTER_CALL_42| .cse7)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 4)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse4)) (= (select (select |c_#memory_$Pointer$.offset| .cse3) (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|))))) is different from true [2022-11-03 03:58:09,021 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse10 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse3 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse2 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse3 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse4 (select |v_#valid_BEFORE_CALL_80| .cse4)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (= (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) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| .cse1)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 4)) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 4))) (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_old(#valid)_AFTER_CALL_42| .cse9)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse8)))))))) is different from false [2022-11-03 03:58:09,025 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse10 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse6 (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse3 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse2 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.base| .cse7) 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse1 .cse2)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse3 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse4 (select |v_#valid_BEFORE_CALL_80| .cse4)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (= (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) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| .cse1)) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse2) 4)) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse2)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse7) (= .cse8 .cse7) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse7) 4))) (not (= .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse9 (select |v_old(#valid)_AFTER_CALL_42| .cse9)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse8)))))))) is different from true [2022-11-03 03:58:09,039 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse6) 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse1 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| .cse3)) (= (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) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 4)) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4)) (= (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse6) (= .cse7 .cse6) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 4))) (not (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse8 (select |v_old(#valid)_AFTER_CALL_42| .cse8)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse7))))))) is different from false [2022-11-03 03:58:09,044 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse4 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.base| .cse6) 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse1 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (= .cse3 .cse4)) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| .cse3)) (= (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) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 4)) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4)) (= (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse6) (= .cse7 .cse6) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse6) 4))) (not (= .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse8 (select |v_old(#valid)_AFTER_CALL_42| .cse8)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse7))))))) is different from true [2022-11-03 03:58:09,059 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (= .cse2 .cse3)) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse4) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| .cse2)) (= .cse4 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 4)) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse5) (= .cse6 .cse5) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 4))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse5) (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_old(#valid)_AFTER_CALL_42| .cse7)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse6))))))) is different from false [2022-11-03 03:58:09,063 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| .cse5) 0))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse0 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (= .cse2 .cse3)) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse4) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| .cse2)) (= .cse4 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse3) 4)) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse5) (= .cse6 .cse5) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse5) 4))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse5) (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse5) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_old(#valid)_AFTER_CALL_42| .cse7)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse6))))))) is different from true [2022-11-03 03:58:09,081 WARN L833 $PredicateComparison]: unable to prove that (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 ((.cse6 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse1 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (= .cse3 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 4)) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) (= .cse5 .cse4) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 4))) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select .cse6 .cse3) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_old(#valid)_AFTER_CALL_42| .cse7)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse5)))))))) is different from false [2022-11-03 03:58:09,085 WARN L855 $PredicateComparison]: unable to prove that (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 ((.cse6 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 2)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse6 0))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_253 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (and (<= .cse1 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_#valid_BEFORE_CALL_80| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse2 (select |v_#valid_BEFORE_CALL_80| .cse2)))) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (= .cse3 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse0) 4)) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse4) (= .cse5 .cse4) (= |c_ULTIMATE.start_main_~data~0#1| (select (select |c_#memory_int| .cse4) 4))) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select .cse6 .cse3) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_42| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse7 (select |v_old(#valid)_AFTER_CALL_42| .cse7)))) (= 1 (select |v_old(#valid)_AFTER_CALL_43| .cse5)))))))) is different from true [2022-11-03 03:58:09,103 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_271 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_253 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimCell_271))) (and (not (= v_arrayElimIndex_14 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimIndex_14) 1) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_old(#valid)_AFTER_CALL_42| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_271) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1)))))) is different from false [2022-11-03 03:58:09,107 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 4)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_271 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_253 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse2 (+ 2 v_arrayElimCell_271))) (and (not (= v_arrayElimIndex_14 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_42| |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_80| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |v_#valid_BEFORE_CALL_80| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimIndex_14) 1) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (= (select |v_old(#valid)_AFTER_CALL_43| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (<= .cse2 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse3 (select |v_old(#valid)_AFTER_CALL_42| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_271) 0) (<= .cse2 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1)))))) is different from true [2022-11-03 03:58:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:09,210 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-11-03 03:58:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 03:58:09,212 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2022-11-03 03:58:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:09,213 INFO L225 Difference]: With dead ends: 56 [2022-11-03 03:58:09,214 INFO L226 Difference]: Without dead ends: 54 [2022-11-03 03:58:09,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=218, Invalid=2484, Unknown=66, NotChecked=3712, Total=6480 [2022-11-03 03:58:09,216 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:09,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 155 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 244 Invalid, 0 Unknown, 238 Unchecked, 0.3s Time] [2022-11-03 03:58:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-03 03:58:09,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-03 03:58:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 03:58:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-11-03 03:58:09,238 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 28 [2022-11-03 03:58:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:09,242 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-11-03 03:58:09,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 32 states have internal predecessors, (41), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 03:58:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-11-03 03:58:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 03:58:09,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:09,245 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:58:09,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-03 03:58:09,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:09,445 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:58:09,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:09,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1933907603, now seen corresponding path program 1 times [2022-11-03 03:58:09,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:58:09,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292798158] [2022-11-03 03:58:09,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:09,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:58:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:58:12,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:58:12,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292798158] [2022-11-03 03:58:12,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292798158] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:12,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446943973] [2022-11-03 03:58:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:12,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:12,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:58:12,022 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:58:12,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:58:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:12,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-03 03:58:12,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:12,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:58:12,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:12,376 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:58:12,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:58:12,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:58:12,562 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-03 03:58:12,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-03 03:58:12,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:58:12,765 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 03:58:12,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 59 [2022-11-03 03:58:12,863 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-03 03:58:12,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 26 [2022-11-03 03:58:12,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:58:13,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:13,016 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 03:58:13,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 67 [2022-11-03 03:58:13,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:13,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-03 03:58:13,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:13,044 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-03 03:58:13,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2022-11-03 03:58:13,533 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-03 03:58:13,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 67 [2022-11-03 03:58:13,570 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-03 03:58:13,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 112 [2022-11-03 03:58:13,596 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-03 03:58:13,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 147 [2022-11-03 03:58:13,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 93 [2022-11-03 03:58:13,867 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-03 03:58:13,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 38 [2022-11-03 03:58:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:58:13,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:14,019 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_825 (Array Int Int)) (v_ArrVal_824 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_818 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_825))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_824) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-03 03:58:14,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| Int) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_824 (Array Int Int)) (v_ArrVal_818 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_825))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_824) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-03 03:58:14,054 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| Int) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_824 (Array Int Int)) (v_ArrVal_818 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_825))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_824) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-03 03:58:14,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| Int) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_824 (Array Int Int)) (v_ArrVal_818 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_825))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_824) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-03 03:58:14,146 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_28| Int) (v_ArrVal_831 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| Int) (v_ArrVal_825 (Array Int Int)) (v_ArrVal_824 (Array Int Int)) (v_ArrVal_818 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_28|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_28| |c_#StackHeapBarrier|)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_28| v_ArrVal_832)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_28| v_ArrVal_831))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_18| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_28|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_28| v_ArrVal_825))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store .cse2 .cse3 v_ArrVal_824) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_28| v_ArrVal_818) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-11-03 03:58:14,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446943973] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:14,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1188810384] [2022-11-03 03:58:14,150 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-03 03:58:14,150 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:58:14,150 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:58:14,151 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:58:14,151 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:58:14,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:14,186 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:58:14,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 03:58:14,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:14,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 03:58:14,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:58:14,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:58:14,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:14,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:14,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:14,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:58:14,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:14,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:14,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:14,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:58:14,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:14,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:58:14,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:14,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:58:14,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:14,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:58:14,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:14,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:14,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:14,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:14,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:14,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:14,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:14,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:14,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:14,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:14,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:58:14,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:14,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:58:14,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:58:14,755 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:14,757 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:14,758 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:14,761 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:14,763 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:14,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:14,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:14,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:14,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:14,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:14,925 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:14,926 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:14,927 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:14,929 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:14,931 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:14,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:14,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:14,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:14,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:14,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:15,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:58:15,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:15,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:58:15,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:58:15,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:15,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:15,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:15,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:15,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:15,405 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:15,407 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:15,409 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:15,411 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:15,413 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:15,580 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:15,582 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:15,584 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:15,586 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:15,587 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:15,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:15,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:15,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:15,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:15,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:15,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:58:15,723 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:58:15,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:58:15,752 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:58:15,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:58:15,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:15,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:15,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:15,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:15,852 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:15,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:15,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:15,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:15,876 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:15,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:15,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:15,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:15,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:15,950 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:15,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:15,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:15,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:15,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:15,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:16,001 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:16,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:16,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:16,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:16,361 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:58:16,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:58:16,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:16,423 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-03 03:58:16,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-03 03:58:16,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:16,482 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-03 03:58:16,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-03 03:58:16,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:16,573 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:58:16,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:58:16,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:16,641 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-03 03:58:16,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-03 03:58:16,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:17,306 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2022-11-03 03:58:17,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:58:17,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:58:17,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:17,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:58:17,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:17,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:17,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:17,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:17,347 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:58:27,309 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1471#(and (<= |ULTIMATE.start_sll_circular_append_~data#1| 1) (= (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|) (<= 1 |ULTIMATE.start_sll_circular_append_#in~data#1|) (= |ULTIMATE.start_main_~count~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_append_~data#1|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (exists ((v_DerPreprocessor_21 (Array Int Int))) (and (= (select v_DerPreprocessor_21 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (exists ((v_DerPreprocessor_20 (Array Int Int))) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_20) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_21) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_20) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_21) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= v_DerPreprocessor_20 (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_20) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_21) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_20) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_21) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_20) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_21) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_20) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_21) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)))) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= (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) (or (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (exists ((v_DerPreprocessor_24 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select v_DerPreprocessor_24 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (exists ((v_DerPreprocessor_23 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_23) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_24) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_23) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_24) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_23) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_24) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_23) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_24) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) v_DerPreprocessor_23) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_23) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_24) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_23) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_24) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))) (and (exists ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select v_DerPreprocessor_24 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_23) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_24) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_23) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_24) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_23) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_24) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_23) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_24) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) v_DerPreprocessor_23))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 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_main_~data~0#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-03 03:58:27,309 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:58:27,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:58:27,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 42 [2022-11-03 03:58:27,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324584464] [2022-11-03 03:58:27,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:27,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-03 03:58:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:58:27,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-03 03:58:27,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3923, Unknown=41, NotChecked=650, Total=4830 [2022-11-03 03:58:27,314 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 03:58:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:28,879 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2022-11-03 03:58:28,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 03:58:28,880 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 30 [2022-11-03 03:58:28,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:28,881 INFO L225 Difference]: With dead ends: 74 [2022-11-03 03:58:28,881 INFO L226 Difference]: Without dead ends: 71 [2022-11-03 03:58:28,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=313, Invalid=5518, Unknown=41, NotChecked=770, Total=6642 [2022-11-03 03:58:28,884 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:28,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 302 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 459 Invalid, 0 Unknown, 110 Unchecked, 0.5s Time] [2022-11-03 03:58:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-03 03:58:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2022-11-03 03:58:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 03:58:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2022-11-03 03:58:28,906 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 30 [2022-11-03 03:58:28,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:28,906 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2022-11-03 03:58:28,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 03:58:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-11-03 03:58:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 03:58:28,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:28,908 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:58:28,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:29,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 03:58:29,123 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:58:29,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:29,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1917355378, now seen corresponding path program 2 times [2022-11-03 03:58:29,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:58:29,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092562447] [2022-11-03 03:58:29,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:29,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:58:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:30,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:30,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:58:30,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092562447] [2022-11-03 03:58:30,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092562447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:30,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338085685] [2022-11-03 03:58:30,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:58:30,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:30,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:58:30,555 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:58:30,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:58:30,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:58:30,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:58:30,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-03 03:58:30,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:31,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:58:31,204 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_68| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-03 03:58:31,206 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_68| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-03 03:58:31,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:58:31,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:58:31,253 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (< |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_68| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_68| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2022-11-03 03:58:31,256 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (< |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_68| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_68| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from true [2022-11-03 03:58:31,289 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-03 03:58:31,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 42 [2022-11-03 03:58:31,318 INFO L356 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2022-11-03 03:58:31,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-11-03 03:58:31,340 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_68| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0)))))) is different from false [2022-11-03 03:58:31,343 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_68| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0)))))) is different from true [2022-11-03 03:58:31,372 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-03 03:58:31,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 43 [2022-11-03 03:58:31,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:31,386 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:31,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:31,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:31,550 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-03 03:58:31,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 77 [2022-11-03 03:58:31,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:31,615 INFO L356 Elim1Store]: treesize reduction 72, result has 46.7 percent of original size [2022-11-03 03:58:31,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 88 [2022-11-03 03:58:31,660 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (or (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_69| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse2 (select |v_old(#valid)_AFTER_CALL_69| .cse2))) |v_old(#valid)_AFTER_CALL_69|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0))))) is different from false [2022-11-03 03:58:31,663 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (or (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_69| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse2 (select |v_old(#valid)_AFTER_CALL_69| .cse2))) |v_old(#valid)_AFTER_CALL_69|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0))))) is different from true [2022-11-03 03:58:31,738 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse2 (select |v_old(#valid)_AFTER_CALL_69| .cse2))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0)))))) is different from false [2022-11-03 03:58:31,740 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse2 (select |v_old(#valid)_AFTER_CALL_69| .cse2))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0)))))) is different from true [2022-11-03 03:58:31,794 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse4 (select |v_old(#valid)_AFTER_CALL_69| .cse4))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))))))) is different from false [2022-11-03 03:58:31,797 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse4 (select |v_old(#valid)_AFTER_CALL_69| .cse4))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))))))) is different from true [2022-11-03 03:58:31,915 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse5 (select |v_old(#valid)_AFTER_CALL_69| .cse5))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from false [2022-11-03 03:58:31,919 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse5 (select |v_old(#valid)_AFTER_CALL_69| .cse5))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from true [2022-11-03 03:58:32,027 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse8 0)) (.cse6 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse4 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse5 (select |v_old(#valid)_AFTER_CALL_69| .cse5))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))))))) is different from false [2022-11-03 03:58:32,030 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse8 0)) (.cse6 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse4 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse5 (select |v_old(#valid)_AFTER_CALL_69| .cse5))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))))))) is different from true [2022-11-03 03:58:32,094 INFO L356 Elim1Store]: treesize reduction 146, result has 8.8 percent of original size [2022-11-03 03:58:32,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 15 case distinctions, treesize of input 210 treesize of output 109 [2022-11-03 03:58:32,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:32,130 INFO L356 Elim1Store]: treesize reduction 43, result has 18.9 percent of original size [2022-11-03 03:58:32,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 34 [2022-11-03 03:58:32,156 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse0 (select |v_old(#valid)_AFTER_CALL_69| .cse0))) |v_old(#valid)_AFTER_CALL_69|) (= (select |v_old(#valid)_AFTER_CALL_69| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 1)))) is different from false [2022-11-03 03:58:32,158 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) 1) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse0 (select |v_old(#valid)_AFTER_CALL_69| .cse0))) |v_old(#valid)_AFTER_CALL_69|) (= (select |v_old(#valid)_AFTER_CALL_69| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 1)))) is different from true [2022-11-03 03:58:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-03 03:58:32,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:32,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_991)) (.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_990))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse6 (select (select .cse0 .cse3) .cse5)) (.cse7 (select (select .cse4 .cse3) .cse5))) (let ((.cse1 (select (select .cse0 .cse6) .cse7)) (.cse2 (select (select .cse4 .cse6) .cse7))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (not (= (select (select .cse0 .cse1) .cse2) .cse3)) (not (= (select (select .cse4 .cse1) .cse2) .cse5)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0)))))))) is different from false [2022-11-03 03:58:32,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338085685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:32,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [895824230] [2022-11-03 03:58:32,485 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-03 03:58:32,485 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:58:32,486 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:58:32,486 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:58:32,486 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:58:32,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:32,517 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:58:32,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 03:58:32,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:32,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 03:58:32,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:58:32,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:58:32,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:32,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:32,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:32,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:58:32,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:32,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:32,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:32,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:58:32,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:32,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:58:32,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:32,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:58:32,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:32,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:58:32,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:32,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:32,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:32,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:32,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:32,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:32,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:32,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:32,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:32,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:32,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:58:32,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:58:32,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:32,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:58:32,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:32,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:32,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:32,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:32,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:33,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:33,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:33,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:33,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:33,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:33,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:33,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:58:33,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:58:33,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:58:33,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:33,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:33,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:33,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:33,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:33,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:33,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:33,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:33,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:33,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:33,343 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:58:33,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:58:33,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:58:33,388 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:58:33,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:58:33,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:33,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:33,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:33,512 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:33,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:33,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:33,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:33,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:33,549 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:33,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:33,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:33,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:33,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:33,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:33,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:33,645 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:33,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:33,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:33,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:33,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:33,681 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:33,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:33,966 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-03 03:58:33,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-03 03:58:33,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:34,049 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:58:34,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:58:34,113 INFO L356 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-03 03:58:34,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-03 03:58:34,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:34,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:34,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:58:34,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-03 03:58:34,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:34,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:34,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2022-11-03 03:58:34,242 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:34,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 03:58:34,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:34,400 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:58:34,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:58:34,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:34,502 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-03 03:58:34,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-03 03:58:34,514 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:58:34,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:34,947 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 18 for LOIs [2022-11-03 03:58:34,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:58:34,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:58:34,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:34,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:34,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:34,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:34,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:34,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:58:34,993 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:58:42,249 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1873#(and (<= |ULTIMATE.start_sll_circular_append_~data#1| 1) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_sll_circular_append_#in~data#1|) (or (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_append_~data#1|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (or (and (or (exists ((v_DerPreprocessor_31 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_DerPreprocessor_31 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (exists ((v_DerPreprocessor_30 (Array Int Int))) (and (= v_DerPreprocessor_30 (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_30) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_31) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_30) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_31) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_30) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_31) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_30) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_31) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_30) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_31) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_30) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_31) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))))) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int))) (and (= v_DerPreprocessor_30 (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_30) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_31) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_30) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_31) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_DerPreprocessor_31 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_30) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_31) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_30) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_31) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-03 03:58:42,249 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:58:42,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:58:42,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 35 [2022-11-03 03:58:42,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471597086] [2022-11-03 03:58:42,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:42,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:58:42,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:58:42,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:58:42,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2169, Unknown=35, NotChecked=1030, Total=3422 [2022-11-03 03:58:42,252 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 35 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 03:58:42,476 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_68| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-03 03:58:42,479 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_68| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-03 03:58:42,483 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| .cse0) (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.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_68| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-03 03:58:42,486 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| .cse0) (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.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_68| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-03 03:58:42,491 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse2) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_68| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_68| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse3) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-11-03 03:58:42,494 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse2) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_68| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse5 (select |c_#valid| .cse5)))) (= (select |v_old(#valid)_AFTER_CALL_68| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse3) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-11-03 03:58:42,503 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse0 (select .cse7 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (or (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_69| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse6 (select |v_old(#valid)_AFTER_CALL_69| .cse6))) |v_old(#valid)_AFTER_CALL_69|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0)))))) is different from false [2022-11-03 03:58:42,507 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse0 (select .cse7 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (or (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_69| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse6 (select |v_old(#valid)_AFTER_CALL_69| .cse6))) |v_old(#valid)_AFTER_CALL_69|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (= |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| 0) (or (= .cse0 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0)))))) is different from true [2022-11-03 03:58:42,512 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse6 (select |v_old(#valid)_AFTER_CALL_69| .cse6))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))))))) is different from false [2022-11-03 03:58:42,514 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse6 (select |v_old(#valid)_AFTER_CALL_69| .cse6))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))))))) is different from true [2022-11-03 03:58:42,519 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse7 0))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) .cse4) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse3) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse4 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse5 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse6 (select |v_old(#valid)_AFTER_CALL_69| .cse6))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse3) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) .cse3))))) is different from false [2022-11-03 03:58:42,522 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse7 0))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) .cse4) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse3) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse4 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse5 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse6 (select |v_old(#valid)_AFTER_CALL_69| .cse6))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse3) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) .cse3))))) is different from true [2022-11-03 03:58:42,536 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse8 0)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse2) (= .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse5 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse7 (select |v_old(#valid)_AFTER_CALL_69| .cse7))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))))))) is different from false [2022-11-03 03:58:42,539 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse8 0)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse2) (= .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse5 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse6 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= .cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse7 (select |v_old(#valid)_AFTER_CALL_69| .cse7))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))))))) is different from true [2022-11-03 03:58:42,544 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse5 (select |v_old(#valid)_AFTER_CALL_69| .cse5))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse4))))) is different from false [2022-11-03 03:58:42,547 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse5 (select |v_old(#valid)_AFTER_CALL_69| .cse5))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse4))))) is different from true [2022-11-03 03:58:42,553 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse5 (select |v_old(#valid)_AFTER_CALL_69| .cse5))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from false [2022-11-03 03:58:42,556 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_69| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_old(#valid)_AFTER_CALL_69| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_69| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| .cse1) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_68| |v_old(#valid)_AFTER_CALL_69|))) (store |v_old(#valid)_AFTER_CALL_68| .cse5 (select |v_old(#valid)_AFTER_CALL_69| .cse5))) |v_old(#valid)_AFTER_CALL_69|) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 0))) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse4) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from true [2022-11-03 03:58:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:42,659 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-11-03 03:58:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 03:58:42,663 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 30 [2022-11-03 03:58:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:42,664 INFO L225 Difference]: With dead ends: 74 [2022-11-03 03:58:42,664 INFO L226 Difference]: Without dead ends: 64 [2022-11-03 03:58:42,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=235, Invalid=2544, Unknown=53, NotChecked=2280, Total=5112 [2022-11-03 03:58:42,667 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:42,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 169 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 203 Unchecked, 0.1s Time] [2022-11-03 03:58:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-03 03:58:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-03 03:58:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 03:58:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2022-11-03 03:58:42,688 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 30 [2022-11-03 03:58:42,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:42,689 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2022-11-03 03:58:42,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 03:58:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-11-03 03:58:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 03:58:42,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:42,690 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] [2022-11-03 03:58:42,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:42,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 03:58:42,895 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:58:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash 178447616, now seen corresponding path program 1 times [2022-11-03 03:58:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:58:42,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11089073] [2022-11-03 03:58:42,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:58:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:45,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:58:45,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11089073] [2022-11-03 03:58:45,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11089073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:45,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004600036] [2022-11-03 03:58:45,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:45,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:45,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:58:45,830 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:58:45,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:58:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:46,350 WARN L261 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 212 conjunts are in the unsatisfiable core [2022-11-03 03:58:46,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:46,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:58:46,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:46,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:58:46,572 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 03:58:46,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 03:58:46,772 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:46,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:58:46,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:46,977 INFO L356 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-11-03 03:58:46,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 29 [2022-11-03 03:58:46,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 03:58:47,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:58:47,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:58:47,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 03:58:47,337 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 03:58:47,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 69 [2022-11-03 03:58:47,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:58:47,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2022-11-03 03:58:47,501 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:47,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2022-11-03 03:58:47,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:58:47,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,521 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:47,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:58:47,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-03 03:58:47,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,769 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 03:58:47,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 68 [2022-11-03 03:58:47,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,795 INFO L356 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-03 03:58:47,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-11-03 03:58:47,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 03:58:47,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:47,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 03:58:49,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,284 INFO L356 Elim1Store]: treesize reduction 362, result has 13.8 percent of original size [2022-11-03 03:58:49,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: var is still there: |v_#memory_$Pointer$.base_145| input size 110 context size 110 output size 110 [2022-11-03 03:58:49,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [88462916] [2022-11-03 03:58:49,287 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-03 03:58:49,287 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:58:49,287 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:58:49,288 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:58:49,288 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:58:49,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,314 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:58:49,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-03 03:58:49,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,337 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:58:49,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 03:58:49,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:58:49,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:58:49,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:58:49,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:49,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:49,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:58:49,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:58:49,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:58:49,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:58:49,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:49,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:49,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:49,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:49,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:49,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:49,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:49,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:49,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:49,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:49,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:49,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-03 03:58:49,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:49,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 207 [2022-11-03 03:58:49,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:49,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 114 [2022-11-03 03:58:49,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:49,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:49,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:49,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:49,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:49,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:49,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:49,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:49,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:49,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:49,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:58:49,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:49,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:58:49,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:58:50,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:50,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:50,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:50,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:50,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:50,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:50,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:50,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:50,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:50,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:58:50,233 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:58:50,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-11-03 03:58:50,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:50,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-03 03:58:50,275 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:58:50,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:58:50,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:50,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:50,357 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:50,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:50,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 03:58:50,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:50,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:50,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:50,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:50,417 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:50,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:50,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:50,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:50,488 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:50,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:50,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 03:58:50,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:50,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:50,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:50,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:50,553 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:50,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:58:50,708 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-03 03:58:50,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-03 03:58:50,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:50,815 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:58:50,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:58:50,891 INFO L356 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-03 03:58:50,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-03 03:58:50,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:50,938 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:58:50,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-03 03:58:50,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:50,979 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:50,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-11-03 03:58:50,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:50,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:50,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2022-11-03 03:58:51,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:51,141 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:58:51,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:58:51,217 INFO L356 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-03 03:58:51,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-03 03:58:51,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:51,262 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:51,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:58:51,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:58:51,305 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:58:51,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:58:51,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:51,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:58:51,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:58:51,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:51,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-11-03 03:58:52,501 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2022-11-03 03:58:52,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:58:52,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:58:52,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:52,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:52,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:52,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:58:52,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:52,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:58:52,541 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:58:58,510 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2224#(and (<= |ULTIMATE.start_sll_circular_append_~data#1| 1) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |ULTIMATE.start_sll_circular_append_#in~data#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) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_append_~data#1|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-03 03:58:58,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:58:58,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:58:58,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2022-11-03 03:58:58,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089128051] [2022-11-03 03:58:58,511 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:58,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 03:58:58,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:58:58,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 03:58:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3838, Unknown=6, NotChecked=0, Total=4032 [2022-11-03 03:58:58,513 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:59:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:00,100 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2022-11-03 03:59:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 03:59:00,101 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 20 states have internal predecessors, (25), 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) Word has length 31 [2022-11-03 03:59:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:00,101 INFO L225 Difference]: With dead ends: 75 [2022-11-03 03:59:00,102 INFO L226 Difference]: Without dead ends: 73 [2022-11-03 03:59:00,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=239, Invalid=4724, Unknown=7, NotChecked=0, Total=4970 [2022-11-03 03:59:00,104 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:00,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 135 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 03:59:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-03 03:59:00,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-11-03 03:59:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 03:59:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2022-11-03 03:59:00,127 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 31 [2022-11-03 03:59:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:00,127 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2022-11-03 03:59:00,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:59:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-11-03 03:59:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 03:59:00,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:00,129 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] [2022-11-03 03:59:00,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:00,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:00,346 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:59:00,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash -308595274, now seen corresponding path program 1 times [2022-11-03 03:59:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:00,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581894957] [2022-11-03 03:59:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:59:03,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:03,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581894957] [2022-11-03 03:59:03,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581894957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:03,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838649555] [2022-11-03 03:59:03,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:03,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:03,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:03,002 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:03,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:59:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:03,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-03 03:59:03,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:03,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:59:03,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:03,876 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:59:03,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:59:03,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:03,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:04,083 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 03:59:04,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-03 03:59:04,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 03:59:04,209 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:59:04,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 32 [2022-11-03 03:59:04,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:04,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:59:04,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:04,378 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 03:59:04,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-11-03 03:59:04,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:04,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:04,397 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 03:59:04,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-03 03:59:04,429 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-03 03:59:04,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 03:59:05,106 INFO L356 Elim1Store]: treesize reduction 111, result has 14.0 percent of original size [2022-11-03 03:59:05,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 94 [2022-11-03 03:59:05,139 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-03 03:59:05,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 163 [2022-11-03 03:59:05,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:05,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:05,151 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:05,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 136 [2022-11-03 03:59:05,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:05,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:05,182 INFO L356 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-03 03:59:05,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 134 [2022-11-03 03:59:05,689 INFO L356 Elim1Store]: treesize reduction 97, result has 13.4 percent of original size [2022-11-03 03:59:05,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 171 treesize of output 84 [2022-11-03 03:59:05,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:05,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2022-11-03 03:59:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:05,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:05,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1326 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1327))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1326))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))) is different from false [2022-11-03 03:59:05,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1326 (Array Int Int))) (not (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1327))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1326))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1)))))) is different from false [2022-11-03 03:59:05,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1326 (Array Int Int))) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1327))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1326))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))))) is different from false [2022-11-03 03:59:05,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1326 (Array Int Int))) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1327))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1326))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse1 (select (select .cse1 .cse0) .cse2)) (select (select .cse3 .cse0) .cse2))))))))))) is different from false [2022-11-03 03:59:06,055 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| Int) (v_ArrVal_1339 (Array Int Int)) (v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1326 (Array Int Int))) (or (not (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_1338)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_1339))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse9 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse5 (select (select .cse7 .cse8) .cse9)) (.cse6 (select (select .cse4 .cse8) .cse9))) (let ((.cse0 (store (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_1327))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_1326))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| |c_#StackHeapBarrier|)))) is different from false [2022-11-03 03:59:06,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838649555] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:06,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [620864547] [2022-11-03 03:59:06,063 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-03 03:59:06,064 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:59:06,064 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:59:06,064 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:59:06,064 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:59:06,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:06,094 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:59:06,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 03:59:06,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:06,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 03:59:06,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:59:06,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:59:06,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:06,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:59:06,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:06,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:06,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:06,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:06,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:06,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:59:06,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:06,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:59:06,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:06,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:59:06,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:06,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:59:06,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:06,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:06,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:06,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:06,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:06,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:06,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:06,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:06,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:06,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:06,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:59:06,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:06,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:59:06,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:59:06,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:06,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:06,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:06,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:06,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:06,731 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:06,733 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:06,734 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:06,736 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:06,737 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:06,927 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:06,929 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:06,931 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:06,932 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:06,934 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:06,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:06,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:06,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:06,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:06,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:07,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:59:07,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:59:07,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:07,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:59:07,395 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:07,396 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:07,398 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:07,401 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:07,403 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:07,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:07,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:07,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:07,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:07,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:07,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:07,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:07,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:07,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:07,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:07,635 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:07,636 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:07,638 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:07,640 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:07,641 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:07,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:59:07,722 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:59:07,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:59:07,749 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:59:07,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:59:07,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:07,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:07,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:07,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:07,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:07,858 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:07,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:59:07,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:07,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:07,881 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:07,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:59:07,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:07,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:07,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:07,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:07,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:07,985 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:07,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:59:08,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:08,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:08,008 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:08,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:59:08,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:08,248 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:59:08,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:59:08,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:08,324 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-03 03:59:08,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-03 03:59:08,330 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:08,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:08,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:08,454 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:59:08,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:59:08,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:08,519 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-03 03:59:08,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-03 03:59:08,524 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:08,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:08,595 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-03 03:59:08,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-03 03:59:09,188 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 03:59:09,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:59:09,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:59:09,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:09,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:09,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:09,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:09,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:09,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:59:09,230 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:59:15,671 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2652#(and (<= |ULTIMATE.start_sll_circular_append_~data#1| 1) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (not (= |ULTIMATE.start_main_~count~0#1| (+ |ULTIMATE.start_main_~len~0#1| 1))) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_append_~data#1|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.offset_33| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_35| Int)) (and (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~ptr~0#1.base_35|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_35|) |v_ULTIMATE.start_main_~ptr~0#1.offset_33|)) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~ptr~0#1.base_35|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_33| 4)) |ULTIMATE.start_main_~data~0#1|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-03 03:59:15,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:59:15,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:59:15,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 43 [2022-11-03 03:59:15,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969469048] [2022-11-03 03:59:15,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:15,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-03 03:59:15,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:15,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-03 03:59:15,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=4082, Unknown=11, NotChecked=660, Total=4970 [2022-11-03 03:59:15,674 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 43 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 03:59:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:17,786 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-11-03 03:59:17,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 03:59:17,787 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 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 33 [2022-11-03 03:59:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:17,788 INFO L225 Difference]: With dead ends: 77 [2022-11-03 03:59:17,788 INFO L226 Difference]: Without dead ends: 74 [2022-11-03 03:59:17,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=341, Invalid=5520, Unknown=11, NotChecked=770, Total=6642 [2022-11-03 03:59:17,790 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:17,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 265 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 578 Invalid, 0 Unknown, 78 Unchecked, 0.6s Time] [2022-11-03 03:59:17,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-03 03:59:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-11-03 03:59:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-03 03:59:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2022-11-03 03:59:17,811 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 33 [2022-11-03 03:59:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:17,811 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2022-11-03 03:59:17,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 03:59:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-11-03 03:59:17,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 03:59:17,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:17,813 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, 1] [2022-11-03 03:59:17,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:18,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:18,017 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:59:18,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:18,017 INFO L85 PathProgramCache]: Analyzing trace with hash 773748330, now seen corresponding path program 3 times [2022-11-03 03:59:18,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:18,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000053075] [2022-11-03 03:59:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:18,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 03:59:18,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:18,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000053075] [2022-11-03 03:59:18,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000053075] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:18,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037939759] [2022-11-03 03:59:18,099 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:59:18,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:18,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:18,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:18,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:59:18,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:59:18,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:59:18,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 03:59:18,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 03:59:18,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:59:18,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037939759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:59:18,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:59:18,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-03 03:59:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564889245] [2022-11-03 03:59:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:59:18,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:59:18,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:18,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:59:18,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:59:18,722 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 03:59:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:18,764 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-11-03 03:59:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:59:18,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 34 [2022-11-03 03:59:18,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:18,765 INFO L225 Difference]: With dead ends: 77 [2022-11-03 03:59:18,765 INFO L226 Difference]: Without dead ends: 37 [2022-11-03 03:59:18,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:59:18,767 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:18,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 26 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:59:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-03 03:59:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-03 03:59:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:59:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-11-03 03:59:18,783 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2022-11-03 03:59:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:18,783 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-11-03 03:59:18,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-03 03:59:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-11-03 03:59:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 03:59:18,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:18,784 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] [2022-11-03 03:59:18,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:19,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 03:59:19,001 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:59:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:19,002 INFO L85 PathProgramCache]: Analyzing trace with hash -976477737, now seen corresponding path program 2 times [2022-11-03 03:59:19,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:19,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585006093] [2022-11-03 03:59:19,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:19,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:59:21,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:21,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585006093] [2022-11-03 03:59:21,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585006093] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:21,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176326946] [2022-11-03 03:59:21,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:59:21,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:21,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:21,691 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:21,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 03:59:22,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:59:22,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:59:22,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 189 conjunts are in the unsatisfiable core [2022-11-03 03:59:22,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:22,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:59:22,415 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:59:22,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:59:22,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:22,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:22,648 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-03 03:59:22,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 50 [2022-11-03 03:59:22,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-03 03:59:22,797 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 03:59:22,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 41 [2022-11-03 03:59:22,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:22,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:22,812 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:22,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:59:22,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 03:59:22,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:22,996 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-03 03:59:22,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 85 [2022-11-03 03:59:23,019 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-03 03:59:23,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 03:59:23,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:23,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:23,046 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-03 03:59:23,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2022-11-03 03:59:24,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:24,279 INFO L356 Elim1Store]: treesize reduction 444, result has 11.6 percent of original size [2022-11-03 03:59:24,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: var is still there: |v_#memory_$Pointer$.base_172| input size 108 context size 108 output size 108 [2022-11-03 03:59:24,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1567943920] [2022-11-03 03:59:24,282 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-03 03:59:24,282 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:59:24,283 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:59:24,283 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:59:24,283 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:59:24,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:24,319 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:59:24,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-03 03:59:24,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:24,347 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:59:24,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 03:59:24,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:59:24,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:59:24,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:24,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:59:24,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:24,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:24,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:24,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:24,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:24,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:59:24,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:24,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:59:24,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:24,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:59:24,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:24,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:59:24,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:24,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:24,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:24,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:24,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:24,757 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:24,759 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:24,761 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:24,762 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:24,763 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:24,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:24,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:24,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 03:59:24,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:24,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:24,965 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:24,966 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:24,968 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:24,970 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:24,971 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:25,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:25,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:25,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-03 03:59:25,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:25,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 207 [2022-11-03 03:59:25,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:25,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 110 [2022-11-03 03:59:25,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:25,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 124 [2022-11-03 03:59:25,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:25,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-03 03:59:25,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:25,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120 [2022-11-03 03:59:25,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 03:59:25,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:25,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:25,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:25,505 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:25,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:59:25,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:25,523 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:25,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:59:25,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:25,631 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:25,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:59:25,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:25,649 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:25,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:59:25,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:25,898 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:59:25,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:59:25,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:25,959 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-03 03:59:25,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-03 03:59:25,968 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:25,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:26,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:26,099 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:59:26,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:59:26,165 INFO L356 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-03 03:59:26,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-03 03:59:26,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:26,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:26,220 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:26,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:26,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:26,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:26,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-11-03 03:59:26,264 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:26,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:26,349 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-03 03:59:26,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-03 03:59:27,019 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 20 for LOIs [2022-11-03 03:59:27,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:59:27,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:59:27,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:27,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:27,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:27,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:59:27,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:27,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:27,072 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:59:32,330 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3265#(and (<= |ULTIMATE.start_sll_circular_append_~data#1| 1) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |ULTIMATE.start_sll_circular_append_#in~data#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_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_append_~data#1|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-03 03:59:32,330 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:59:32,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:59:32,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2022-11-03 03:59:32,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470982705] [2022-11-03 03:59:32,330 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:32,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 03:59:32,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:32,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 03:59:32,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3244, Unknown=4, NotChecked=0, Total=3422 [2022-11-03 03:59:32,332 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:59:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:34,394 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-11-03 03:59:34,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 03:59:34,395 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2022-11-03 03:59:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:34,395 INFO L225 Difference]: With dead ends: 41 [2022-11-03 03:59:34,396 INFO L226 Difference]: Without dead ends: 39 [2022-11-03 03:59:34,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=251, Invalid=4574, Unknown=5, NotChecked=0, Total=4830 [2022-11-03 03:59:34,397 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:34,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 123 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:59:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-03 03:59:34,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-03 03:59:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:59:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-11-03 03:59:34,412 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2022-11-03 03:59:34,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:34,413 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-11-03 03:59:34,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:59:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-11-03 03:59:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 03:59:34,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:34,413 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:34,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:34,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:34,614 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:59:34,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:34,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2090297139, now seen corresponding path program 2 times [2022-11-03 03:59:34,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:34,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383838114] [2022-11-03 03:59:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:34,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 03:59:34,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:34,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383838114] [2022-11-03 03:59:34,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383838114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:34,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491454261] [2022-11-03 03:59:34,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:59:34,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:34,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:34,762 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:34,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 03:59:35,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:59:35,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:59:35,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 03:59:35,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 03:59:35,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 03:59:35,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491454261] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:35,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [552316526] [2022-11-03 03:59:35,302 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-03 03:59:35,302 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:59:35,302 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:59:35,302 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:59:35,303 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:59:35,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:35,337 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:59:35,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 03:59:35,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:35,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 03:59:35,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:59:35,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:59:35,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:35,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:35,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:35,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:59:35,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:35,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:35,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:35,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:59:35,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:35,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:59:35,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:35,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:59:35,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:35,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:59:35,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:35,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:35,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:35,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:35,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:35,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:35,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:35,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:35,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:35,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:35,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:35,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:59:35,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:59:35,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 03:59:35,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:35,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:35,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:35,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:35,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:35,987 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:35,990 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:35,993 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:35,995 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:35,997 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:36,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:36,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:36,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:36,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:36,266 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,268 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,270 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,272 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,274 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:36,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:36,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-03 03:59:36,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:36,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 207 [2022-11-03 03:59:36,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:36,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 114 [2022-11-03 03:59:36,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:36,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:36,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:36,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:36,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:36,782 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,784 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,786 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,788 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,789 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,986 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,988 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,989 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,991 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:36,992 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:37,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:37,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:37,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:37,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:37,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:37,101 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:59:37,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:59:37,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-03 03:59:37,142 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 03:59:37,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 03:59:37,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:37,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:37,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:37,226 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:37,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:59:37,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:37,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:37,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:37,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:37,275 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:37,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:59:37,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:37,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:37,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:37,352 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:37,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:59:37,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:37,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:37,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:37,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:37,403 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:37,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 03:59:37,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:37,634 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:59:37,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:59:37,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:37,700 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-03 03:59:37,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-03 03:59:37,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:37,759 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-03 03:59:37,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-03 03:59:37,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:37,841 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:59:37,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:59:37,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:37,902 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-03 03:59:37,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-03 03:59:37,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:38,542 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-03 03:59:38,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:59:38,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:59:38,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:38,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:59:38,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:38,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:38,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:38,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:38,579 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:59:43,101 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3638#(and (<= |ULTIMATE.start_sll_circular_append_~data#1| 1) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= 1 |ULTIMATE.start_main_~count~0#1|) (exists ((|v_ULTIMATE.start_main_~ptr~0#1.offset_43| Int) (|v_ULTIMATE.start_main_~ptr~0#1.base_45| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~ptr~0#1.base_45|) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_43| 4)) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~ptr~0#1.base_45|) |v_ULTIMATE.start_main_~ptr~0#1.offset_43|) |ULTIMATE.start_main_~ptr~0#1.base|) (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~ptr~0#1.base_45|) |v_ULTIMATE.start_main_~ptr~0#1.offset_43|)))) (not (= |ULTIMATE.start_main_~count~0#1| (+ |ULTIMATE.start_main_~len~0#1| 1))) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_append_~data#1|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-03 03:59:43,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:59:43,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:59:43,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-03 03:59:43,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967731996] [2022-11-03 03:59:43,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:43,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:59:43,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:43,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:59:43,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=825, Unknown=2, NotChecked=0, Total=930 [2022-11-03 03:59:43,103 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 03:59:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:43,201 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-11-03 03:59:43,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:59:43,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 36 [2022-11-03 03:59:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:43,202 INFO L225 Difference]: With dead ends: 47 [2022-11-03 03:59:43,202 INFO L226 Difference]: Without dead ends: 44 [2022-11-03 03:59:43,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=103, Invalid=825, Unknown=2, NotChecked=0, Total=930 [2022-11-03 03:59:43,203 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:43,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 180 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:59:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-03 03:59:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2022-11-03 03:59:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 03:59:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-11-03 03:59:43,223 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2022-11-03 03:59:43,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:43,224 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-11-03 03:59:43,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-03 03:59:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-11-03 03:59:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 03:59:43,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:43,225 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:43,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:43,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:43,441 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 03:59:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash -374660704, now seen corresponding path program 3 times [2022-11-03 03:59:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:43,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673697657] [2022-11-03 03:59:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:43,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:46,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:46,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673697657] [2022-11-03 03:59:46,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673697657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:46,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327739408] [2022-11-03 03:59:46,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:59:46,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:46,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:46,353 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:46,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 03:59:46,621 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:59:46,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:59:46,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 153 conjunts are in the unsatisfiable core [2022-11-03 03:59:46,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:46,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:59:50,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:50,383 INFO L356 Elim1Store]: treesize reduction 44, result has 35.3 percent of original size [2022-11-03 03:59:50,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 50 [2022-11-03 03:59:50,394 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:59:50,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 03:59:50,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:50,437 INFO L356 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-11-03 03:59:50,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 37 [2022-11-03 03:59:51,869 INFO L356 Elim1Store]: treesize reduction 328, result has 27.9 percent of original size [2022-11-03 03:59:51,869 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: var is still there: |v_#memory_$Pointer$.base_201| input size 117 context size 117 output size 117 [2022-11-03 03:59:51,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [296021157] [2022-11-03 03:59:51,871 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-03 03:59:51,871 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 03:59:51,872 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 03:59:51,872 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 03:59:51,872 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 03:59:51,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:51,901 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:59:51,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-03 03:59:51,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:51,935 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:59:51,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-03 03:59:51,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:59:51,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:59:51,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:51,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:51,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:51,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:59:51,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:51,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:52,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:52,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:59:52,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:52,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:59:52,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:52,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-03 03:59:52,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:52,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-03 03:59:52,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:52,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:52,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:52,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:52,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:52,289 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:52,290 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:52,292 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:52,295 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:52,296 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:52,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:52,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:52,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:52,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-03 03:59:52,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 03:59:52,543 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:52,545 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:52,546 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:52,548 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:52,550 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:52,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:52,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:52,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2022-11-03 03:59:52,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:52,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 207 [2022-11-03 03:59:52,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:52,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 110 [2022-11-03 03:59:52,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 03:59:52,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:52,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:52,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:52,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 03:59:52,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 03:59:53,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:53,062 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:53,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:59:53,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:53,079 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:53,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:59:53,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:53,173 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:53,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:59:53,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:53,193 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 03:59:53,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 03:59:53,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:53,390 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:59:53,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:59:53,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:53,449 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-03 03:59:53,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-03 03:59:53,458 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:53,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:53,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:59:53,573 INFO L356 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-03 03:59:53,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-03 03:59:53,650 INFO L356 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-03 03:59:53,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 67 [2022-11-03 03:59:53,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:53,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 03:59:53,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:59:53,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-03 03:59:53,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:59:53,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-03 03:59:53,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:53,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-11-03 03:59:53,762 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-03 03:59:53,842 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-03 03:59:53,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-03 03:59:54,424 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 20 for LOIs [2022-11-03 03:59:54,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 03:59:54,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 03:59:54,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:54,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:54,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:54,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-03 03:59:54,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:54,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-03 03:59:54,471 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 03:59:59,185 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3890#(and (<= |ULTIMATE.start_sll_circular_append_~data#1| 1) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 1 |ULTIMATE.start_sll_circular_append_#in~data#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_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_append_~data#1|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-03 03:59:59,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 03:59:59,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:59:59,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2022-11-03 03:59:59,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073778339] [2022-11-03 03:59:59,185 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:59,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 03:59:59,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:59,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 03:59:59,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=3361, Unknown=7, NotChecked=0, Total=3540 [2022-11-03 03:59:59,187 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:00:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:02,314 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-11-03 04:00:02,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 04:00:02,314 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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) Word has length 37 [2022-11-03 04:00:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:02,315 INFO L225 Difference]: With dead ends: 40 [2022-11-03 04:00:02,315 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 04:00:02,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=272, Invalid=5122, Unknown=8, NotChecked=0, Total=5402 [2022-11-03 04:00:02,317 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:02,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:00:02,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 04:00:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 04:00:02,318 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-11-03 04:00:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 04:00:02,318 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2022-11-03 04:00:02,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:02,319 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 04:00:02,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:00:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 04:00:02,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 04:00:02,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 04:00:02,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-03 04:00:02,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 04:00:02,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 04:00:10,241 WARN L234 SmtUtils]: Spent 5.89s on a formula simplification. DAG size of input: 289 DAG size of output: 134 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 04:01:33,245 WARN L234 SmtUtils]: Spent 1.38m on a formula simplification. DAG size of input: 329 DAG size of output: 221 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 04:01:33,249 INFO L899 garLoopResultBuilder]: For program point L613-4(lines 613 615) no Hoare annotation was computed. [2022-11-03 04:01:33,249 INFO L899 garLoopResultBuilder]: For program point L606(lines 606 619) no Hoare annotation was computed. [2022-11-03 04:01:33,249 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 04:01:33,249 INFO L895 garLoopResultBuilder]: At program point L635(lines 620 641) the Hoare annotation is: false [2022-11-03 04:01:33,249 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 639) no Hoare annotation was computed. [2022-11-03 04:01:33,250 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2022-11-03 04:01:33,250 INFO L899 garLoopResultBuilder]: For program point L627-2(lines 627 633) no Hoare annotation was computed. [2022-11-03 04:01:33,250 INFO L895 garLoopResultBuilder]: At program point L627-4(lines 627 633) the Hoare annotation is: (let ((.cse31 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse60 (select |#memory_$Pointer$.offset| .cse31)) (.cse61 (select |#memory_$Pointer$.base| .cse31)) (.cse39 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse53 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse59 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse41 (select .cse53 |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse0 (select .cse61 .cse39)) (.cse20 (select .cse60 .cse39))) (let ((.cse55 (select (select |#memory_$Pointer$.base| .cse0) .cse20)) (.cse36 (select .cse61 0)) (.cse37 (select .cse60 0)) (.cse58 (select |#memory_$Pointer$.base| .cse41)) (.cse52 (select .cse59 |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse51 (select .cse58 .cse52)) (.cse14 (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0)) (.cse49 (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse58 (select .cse59 |ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse30 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|)) (.cse54 (select (select |#memory_$Pointer$.base| .cse36) .cse37)) (.cse57 (= .cse55 .cse31)) (.cse50 (select (select |#memory_$Pointer$.offset| .cse41) .cse52))) (let ((.cse27 (= .cse52 .cse50)) (.cse1 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse2 (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse42 (or (and (= .cse39 (select (select |#memory_$Pointer$.offset| .cse55) 0)) (= (select (select |#memory_$Pointer$.base| .cse55) 0) .cse31)) .cse57)) (.cse5 (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (not (= .cse54 .cse31))) (.cse7 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse8 (<= |#NULL.offset| 0)) (.cse9 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse44 (= |ULTIMATE.start_main_~ptr~0#1.offset| 0)) (.cse10 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse11 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse45 (let ((.cse56 (select (select |#memory_$Pointer$.offset| .cse0) .cse20))) (or (and (= (select (select |#memory_int| .cse55) 4) |ULTIMATE.start_main_~data~0#1|) (= .cse56 0)) (and .cse57 (= .cse56 .cse39))))) (.cse12 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse15 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse16 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse17 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse40 (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|)) (.cse18 (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse36))) (.cse19 (<= (+ .cse54 2) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse21 (= (select (select |#memory_int| .cse30) 4) |ULTIMATE.start_main_~data~0#1|)) (.cse22 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse23 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse24 (= |ULTIMATE.start_sll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse26 (not (= (select .cse53 |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (.cse28 (<= 0 |#NULL.offset|)) (.cse29 (<= (+ 2 .cse36) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse32 (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0)) (.cse33 (<= 0 |#StackHeapBarrier|)) (.cse34 (or (and (not (= .cse51 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) .cse14 (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) (and .cse49 (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| .cse52)))) (.cse35 (or .cse49 (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse50) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse51)))) (.cse38 (= |#NULL.base| 0))) (or (and (= .cse0 |ULTIMATE.start_main_~ptr~0#1.base|) .cse1 (<= 1 |ULTIMATE.start_main_~count~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_main_~count~0#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) .cse16 .cse17 .cse18 .cse19 (= .cse20 |ULTIMATE.start_main_~ptr~0#1.offset|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (= (select (select |#memory_$Pointer$.base| .cse30) 0) .cse31) .cse32 .cse33 .cse34 .cse35 (= (select (select |#memory_$Pointer$.offset| .cse36) .cse37) 0) .cse38 (= .cse39 (select (select |#memory_$Pointer$.offset| .cse30) 0))) (let ((.cse43 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))) (and .cse1 (<= |ULTIMATE.start_main_~count~0#1| 2) .cse2 .cse3 .cse4 (= (select .cse40 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|) (<= 2 |ULTIMATE.start_main_~count~0#1|) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse41)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse41)) .cse42 (= .cse39 .cse43) .cse7 .cse8 .cse9 .cse44 .cse10 .cse11 .cse45 .cse12 .cse13 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) .cse22 .cse23 .cse24 .cse25 (= .cse30 .cse31) (not (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) .cse27 .cse28 (= 0 .cse43) .cse33 .cse34 .cse35 .cse38)) (and .cse1 .cse2 .cse3 (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_41| (Array Int Int)) (v_arrayElimCell_271 Int) (|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (v_arrayElimCell_253 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_14 Int) (|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| Int) (|v_#valid_BEFORE_CALL_80| (Array Int Int))) (let ((.cse47 (+ 2 v_arrayElimCell_271))) (and (not (= v_arrayElimIndex_14 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |v_#valid_BEFORE_CALL_80| (let ((.cse46 (@diff |v_old(#valid)_AFTER_CALL_41| |v_#valid_BEFORE_CALL_80|))) (store |v_old(#valid)_AFTER_CALL_41| .cse46 (select |v_#valid_BEFORE_CALL_80| .cse46)))) (= (select |v_old(#valid)_AFTER_CALL_43| v_arrayElimIndex_14) 1) (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~ptr~0#1.base|) 0) (not (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13| v_arrayElimCell_253)) (<= .cse47 |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse48 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse48 (select |v_old(#valid)_AFTER_CALL_42| .cse48)))) (= (select |v_old(#valid)_AFTER_CALL_42| v_arrayElimCell_271) 0) (<= .cse47 |ULTIMATE.start_main_~#s~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimCell_253) 1) (= (select |v_old(#valid)_AFTER_CALL_41| v_arrayElimIndex_6) 0) (= (select |v_#valid_BEFORE_CALL_80| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_41| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_13|) 1) (= (select |v_old(#valid)_AFTER_CALL_42| |ULTIMATE.start_main_~ptr~0#1.base|) 1)))) .cse4 (= |ULTIMATE.start_main_~ptr~0#1.base| .cse31) (= .cse39 0) .cse42 .cse5 .cse6 .cse7 .cse8 .cse9 .cse44 .cse10 .cse11 (= |ULTIMATE.start_main_~count~0#1| 0) .cse45 .cse12 .cse13 .cse15 .cse16 .cse17 (= (select .cse40 4) |ULTIMATE.start_main_~data~0#1|) .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse32 .cse33 .cse34 .cse35 .cse38)))))))) [2022-11-03 04:01:33,251 INFO L899 garLoopResultBuilder]: For program point L627-5(lines 620 641) no Hoare annotation was computed. [2022-11-03 04:01:33,251 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 (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse3 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse4 (<= |#NULL.offset| 0)) (.cse5 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse6 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse7 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse8 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse9 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse10 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse11 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4) |ULTIMATE.start_main_~data~0#1|)) (.cse12 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse13 (<= 0 |#NULL.offset|)) (.cse14 (<= 0 |#StackHeapBarrier|)) (.cse15 (= |#NULL.base| 0))) (or (and .cse0 (= 2 |ULTIMATE.start_sll_circular_create_~len#1|) .cse1 .cse2 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< |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|) .cse11 (= |ULTIMATE.start_main_~#s~0#1.offset| 0) .cse12 .cse13 (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) .cse14 .cse15) (let ((.cse16 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#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|)) .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) .cse5 .cse6 (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (= .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) .cse7 .cse8 (= (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)) .cse9 .cse10 .cse11 (= .cse16 |ULTIMATE.start_main_~#s~0#1.offset|) .cse12 (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |#valid| (let ((.cse17 (@diff |v_old(#valid)_AFTER_CALL_68| |#valid|))) (store |v_old(#valid)_AFTER_CALL_68| .cse17 (select |#valid| .cse17)))))) .cse13 .cse14 (= .cse16 0) .cse15)))) [2022-11-03 04:01:33,251 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 04:01:33,251 INFO L902 garLoopResultBuilder]: At program point L640(lines 620 641) the Hoare annotation is: true [2022-11-03 04:01:33,251 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 ((.cse0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |#memory_$Pointer$.base| .cse2))) (let ((.cse3 (select .cse7 0)) (.cse5 (select .cse7 .cse0)) (.cse4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#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_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= .cse0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= 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|) (exists ((|v_old(#valid)_AFTER_CALL_41| (Array Int Int))) (and (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_41| |#valid|))) (store |v_old(#valid)_AFTER_CALL_41| .cse1 (select |#valid| .cse1))) |#valid|) (= (select |v_old(#valid)_AFTER_CALL_41| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_41| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_41| .cse3) 1))) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (< .cse3 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_append_~data#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= .cse4 |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (< |#StackHeapBarrier| |ULTIMATE.start_sll_circular_append_~head#1.base|) (= |ULTIMATE.start_sll_circular_create_#res#1.base| .cse2) (= (select (select |#memory_int| .cse5) 4) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| .cse5) (select (select |#memory_$Pointer$.offset| .cse2) .cse0)) 0) (= |ULTIMATE.start_sll_circular_append_#in~data#1| |ULTIMATE.start_sll_circular_append_~data#1|) (<= 0 |#NULL.offset|) (let ((.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (= .cse6 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| .cse6) 0)) 0))) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| .cse2) 4)) (= .cse4 0) (= |#NULL.base| 0))))) [2022-11-03 04:01:33,252 INFO L899 garLoopResultBuilder]: For program point L607-1(line 607) no Hoare annotation was computed. [2022-11-03 04:01:33,252 INFO L899 garLoopResultBuilder]: For program point L628(lines 628 630) no Hoare annotation was computed. [2022-11-03 04:01:33,252 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2022-11-03 04:01:33,252 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (< 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 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|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (<= 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|) (= |#NULL.base| 0)) [2022-11-03 04:01:33,252 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2022-11-03 04:01:33,252 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 618) no Hoare annotation was computed. [2022-11-03 04:01:33,252 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2022-11-03 04:01:33,253 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= 21 (select |#length| 2)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= 2 (select |#length| 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) (= (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-11-03 04:01:33,253 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2022-11-03 04:01:33,253 INFO L899 garLoopResultBuilder]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2022-11-03 04:01:33,253 INFO L895 garLoopResultBuilder]: At program point L613-3(lines 613 615) the Hoare annotation is: (let ((.cse39 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse35 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (select .cse39 0))) (let ((.cse12 (select .cse39 |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse37 (select (select |#memory_$Pointer$.base| .cse24) 0)) (.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse36 (select (select |#memory_$Pointer$.base| .cse35) 0))) (let ((.cse0 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse1 (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse3 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse4 (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse6 (<= |#NULL.offset| 0)) (.cse7 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse8 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse9 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse10 (exists ((|v_old(#valid)_AFTER_CALL_42| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_43| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_43| .cse35) 0) (= (select |v_old(#valid)_AFTER_CALL_43| .cse36) 1) (= (select |v_old(#valid)_AFTER_CALL_42| .cse35) 1) (= |v_old(#valid)_AFTER_CALL_42| (let ((.cse38 (@diff |v_old(#valid)_AFTER_CALL_43| |v_old(#valid)_AFTER_CALL_42|))) (store |v_old(#valid)_AFTER_CALL_43| .cse38 (select |v_old(#valid)_AFTER_CALL_42| .cse38)))) (= (select |v_old(#valid)_AFTER_CALL_42| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))) (.cse11 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse13 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse14 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse15 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse16 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse18 (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) (.cse19 (= (select .cse23 0) 0)) (.cse20 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse21 (= |ULTIMATE.start_sll_circular_append_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse22 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse25 (= (select (select |#memory_$Pointer$.offset| .cse37) 0) 0)) (.cse26 (<= 0 |#NULL.offset|)) (.cse27 (= .cse24 (select (select |#memory_$Pointer$.base| .cse37) 0))) (.cse28 (<= (+ 2 .cse36) |ULTIMATE.start_main_~#s~0#1.base|)) (.cse29 (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) (.cse30 (<= 0 |#StackHeapBarrier|)) (.cse31 (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| .cse35) 4))) (.cse32 (not (= .cse12 0))) (.cse33 (= |#NULL.base| 0)) (.cse17 (select .cse23 |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse12) .cse13 .cse14 .cse15 .cse16 (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) 4) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (select .cse23 |ULTIMATE.start_main_~#s~0#1.offset|)) .cse12)) (= (select (select |#memory_$Pointer$.offset| .cse24) 0) 0) .cse25 (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) .cse17)) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (let ((.cse34 (select (select |#memory_$Pointer$.offset| .cse12) .cse17))) (and .cse0 (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse34) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |#memory_$Pointer$.base| .cse12) .cse17)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) .cse14 (= (select (select |#memory_int| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) 4) |ULTIMATE.start_main_~data~0#1|) .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| .cse34) .cse31 .cse32 .cse33))))))) [2022-11-03 04:01:33,253 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-11-03 04:01:33,253 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-03 04:01:33,254 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (or (not (<= 1 |node_create_#in~data#1|)) (not (= |#NULL.offset| 0)) (not (<= |node_create_#in~data#1| 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.base| 0)) (not (<= 0 |#StackHeapBarrier|))) [2022-11-03 04:01:33,254 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2022-11-03 04:01:33,257 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1] [2022-11-03 04:01:33,259 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 04:01:33,280 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:586) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:164) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:479) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:142) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:136) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) 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-11-03 04:01:33,291 INFO L158 Benchmark]: Toolchain (without parser) took 260370.73ms. Allocated memory was 86.0MB in the beginning and 522.2MB in the end (delta: 436.2MB). Free memory was 48.6MB in the beginning and 240.6MB in the end (delta: -192.0MB). Peak memory consumption was 315.0MB. Max. memory is 16.1GB. [2022-11-03 04:01:33,291 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 86.0MB. Free memory was 66.1MB in the beginning and 66.1MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 04:01:33,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.03ms. Allocated memory is still 86.0MB. Free memory was 48.4MB in the beginning and 52.3MB in the end (delta: -4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 04:01:33,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.10ms. Allocated memory is still 86.0MB. Free memory was 52.3MB in the beginning and 50.1MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 04:01:33,295 INFO L158 Benchmark]: Boogie Preprocessor took 56.30ms. Allocated memory is still 86.0MB. Free memory was 50.1MB in the beginning and 48.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 04:01:33,295 INFO L158 Benchmark]: RCFGBuilder took 632.13ms. Allocated memory was 86.0MB in the beginning and 117.4MB in the end (delta: 31.5MB). Free memory was 48.2MB in the beginning and 87.2MB in the end (delta: -38.9MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2022-11-03 04:01:33,295 INFO L158 Benchmark]: TraceAbstraction took 259019.41ms. Allocated memory was 117.4MB in the beginning and 522.2MB in the end (delta: 404.8MB). Free memory was 86.4MB in the beginning and 240.6MB in the end (delta: -154.2MB). Peak memory consumption was 320.5MB. Max. memory is 16.1GB. [2022-11-03 04:01:33,296 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.28ms. Allocated memory is still 86.0MB. Free memory was 66.1MB in the beginning and 66.1MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 572.03ms. Allocated memory is still 86.0MB. Free memory was 48.4MB in the beginning and 52.3MB in the end (delta: -4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.10ms. Allocated memory is still 86.0MB. Free memory was 52.3MB in the beginning and 50.1MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.30ms. Allocated memory is still 86.0MB. Free memory was 50.1MB in the beginning and 48.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 632.13ms. Allocated memory was 86.0MB in the beginning and 117.4MB in the end (delta: 31.5MB). Free memory was 48.2MB in the beginning and 87.2MB in the end (delta: -38.9MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 259019.41ms. Allocated memory was 117.4MB in the beginning and 522.2MB in the end (delta: 404.8MB). Free memory was 86.4MB in the beginning and 240.6MB in the end (delta: -154.2MB). Peak memory consumption was 320.5MB. 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: 639]: 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 258.9s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 90.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 319 mSDsluCounter, 2112 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 747 IncrementalHoareTripleChecker+Unchecked, 1950 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4249 IncrementalHoareTripleChecker+Invalid, 5214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 198 mSDtfsCounter, 4249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1117 GetRequests, 403 SyntacticMatches, 11 SemanticMatches, 703 ConstructedPredicates, 65 IntricatePredicates, 0 DeprecatedPredicates, 8962 ImplicationChecksByTransitivity, 97.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=8, InterpolantAutomatonStates: 228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 54 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 25 PreInvPairs, 36 NumberOfFragments, 2744 HoareAnnotationTreeSize, 25 FomulaSimplifications, 334 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 6204 FormulaSimplificationTreeSizeReductionInter, 90.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 649 NumberOfCodeBlocks, 649 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 662 ConstructedInterpolants, 37 QuantifiedInterpolants, 17928 SizeOfPredicates, 183 NumberOfNonLiveVariables, 3327 ConjunctsInSsa, 756 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 192/346 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: 3.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 18, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 17, TOOLS_POST_TIME: 0.9s, TOOLS_POST_CALL_APPLICATIONS: 13, TOOLS_POST_CALL_TIME: 1.2s, TOOLS_POST_RETURN_APPLICATIONS: 10, TOOLS_POST_RETURN_TIME: 0.7s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 40, TOOLS_QUANTIFIERELIM_TIME: 2.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 54, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 9, DOMAIN_JOIN_TIME: 0.2s, 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: 18, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 1.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 10, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, 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: 184, DAG_COMPRESSION_RETAINED_NODES: 52, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - 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:586) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-03 04:01:33,508 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-03 04:01:33,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI --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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 04:01:35,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:01:35,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:01:35,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:01:35,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:01:35,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:01:35,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:01:35,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:01:35,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:01:35,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:01:35,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:01:35,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:01:35,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:01:35,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:01:35,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:01:35,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:01:35,899 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:01:35,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:01:35,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:01:35,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:01:35,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:01:35,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:01:35,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:01:35,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:01:35,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:01:35,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:01:35,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:01:35,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:01:35,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:01:35,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:01:35,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:01:35,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:01:35,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:01:35,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:01:35,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:01:35,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:01:35,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:01:35,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:01:35,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:01:35,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:01:35,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:01:35,928 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 04:01:35,952 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:01:35,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:01:35,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:01:35,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:01:35,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:01:35,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:01:35,955 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:01:35,955 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:01:35,955 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:01:35,956 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:01:35,956 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:01:35,956 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:01:35,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:01:35,957 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:01:35,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:01:35,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:01:35,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 04:01:35,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:01:35,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 04:01:35,959 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 04:01:35,960 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 04:01:35,960 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 04:01:35,960 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:01:35,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 04:01:35,961 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:01:35,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 04:01:35,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:01:35,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 04:01:35,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:01:35,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:01:35,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:01:35,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:01:35,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 04:01:35,963 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 04:01:35,964 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 04:01:35,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 04:01:35,964 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:01:35,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 04:01:35,965 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_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2022-11-03 04:01:36,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:01:36,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:01:36,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:01:36,395 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:01:36,396 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:01:36,402 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-03 04:01:36,482 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/data/6f5cb54e0/254c17a815214e16ad45b0f834b0ea2d/FLAG295b4c52b [2022-11-03 04:01:37,241 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:01:37,245 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-03 04:01:37,268 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/data/6f5cb54e0/254c17a815214e16ad45b0f834b0ea2d/FLAG295b4c52b [2022-11-03 04:01:37,457 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/data/6f5cb54e0/254c17a815214e16ad45b0f834b0ea2d [2022-11-03 04:01:37,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:01:37,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:01:37,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:01:37,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:01:37,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:01:37,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:01:37" (1/1) ... [2022-11-03 04:01:37,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cda5114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:37, skipping insertion in model container [2022-11-03 04:01:37,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:01:37" (1/1) ... [2022-11-03 04:01:37,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:01:37,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:01:37,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-03 04:01:37,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:01:37,997 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:01:38,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-03 04:01:38,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:01:38,134 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:01:38,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38 WrapperNode [2022-11-03 04:01:38,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:01:38,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:01:38,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:01:38,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:01:38,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38" (1/1) ... [2022-11-03 04:01:38,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38" (1/1) ... [2022-11-03 04:01:38,202 INFO L138 Inliner]: procedures = 130, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2022-11-03 04:01:38,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:01:38,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:01:38,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:01:38,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:01:38,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38" (1/1) ... [2022-11-03 04:01:38,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38" (1/1) ... [2022-11-03 04:01:38,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38" (1/1) ... [2022-11-03 04:01:38,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38" (1/1) ... [2022-11-03 04:01:38,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38" (1/1) ... [2022-11-03 04:01:38,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38" (1/1) ... [2022-11-03 04:01:38,262 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38" (1/1) ... [2022-11-03 04:01:38,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38" (1/1) ... [2022-11-03 04:01:38,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:01:38,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:01:38,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:01:38,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:01:38,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38" (1/1) ... [2022-11-03 04:01:38,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:01:38,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:01:38,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:01:38,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:01:38,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 04:01:38,360 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-03 04:01:38,361 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-03 04:01:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 04:01:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 04:01:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 04:01:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 04:01:38,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 04:01:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 04:01:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 04:01:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 04:01:38,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 04:01:38,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:01:38,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:01:38,599 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:01:38,601 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:01:39,041 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:01:39,058 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:01:39,060 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 04:01:39,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:01:39 BoogieIcfgContainer [2022-11-03 04:01:39,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:01:39,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:01:39,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:01:39,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:01:39,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:01:37" (1/3) ... [2022-11-03 04:01:39,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9f2f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:01:39, skipping insertion in model container [2022-11-03 04:01:39,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:01:38" (2/3) ... [2022-11-03 04:01:39,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9f2f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:01:39, skipping insertion in model container [2022-11-03 04:01:39,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:01:39" (3/3) ... [2022-11-03 04:01:39,071 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-11-03 04:01:39,090 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:01:39,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 04:01:39,148 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:01:39,155 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;@17b57177, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:01:39,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 04:01:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:01:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:01:39,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:39,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:01:39,171 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:01:39,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash -483023916, now seen corresponding path program 1 times [2022-11-03 04:01:39,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:01:39,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477618909] [2022-11-03 04:01:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:39,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:01:39,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:01:39,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:01:39,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 04:01:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:39,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-03 04:01:39,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:01:39,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:01:39,472 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:01:39,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477618909] [2022-11-03 04:01:39,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477618909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:01:39,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:01:39,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:01:39,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784182485] [2022-11-03 04:01:39,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:01:39,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 04:01:39,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:01:39,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 04:01:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 04:01:39,518 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 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 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 04:01:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:39,549 INFO L93 Difference]: Finished difference Result 65 states and 89 transitions. [2022-11-03 04:01:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 04:01:39,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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 24 [2022-11-03 04:01:39,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:39,569 INFO L225 Difference]: With dead ends: 65 [2022-11-03 04:01:39,569 INFO L226 Difference]: Without dead ends: 28 [2022-11-03 04:01:39,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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-11-03 04:01:39,577 INFO L413 NwaCegarLoop]: 45 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, 45 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-11-03 04:01:39,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:01:39,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-03 04:01:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-03 04:01:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:01:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-11-03 04:01:39,622 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2022-11-03 04:01:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:39,624 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-11-03 04:01:39,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 04:01:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-11-03 04:01:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:01:39,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:39,627 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:01:39,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 04:01:39,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:01:39,842 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:01:39,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash -938400178, now seen corresponding path program 1 times [2022-11-03 04:01:39,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:01:39,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689298644] [2022-11-03 04:01:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:39,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:01:39,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:01:39,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:01:39,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 04:01:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:40,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 04:01:40,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:01:40,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:01:40,138 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:01:40,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689298644] [2022-11-03 04:01:40,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689298644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:01:40,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:01:40,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:01:40,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132258504] [2022-11-03 04:01:40,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:01:40,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:01:40,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:01:40,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:01:40,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:01:40,143 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 04:01:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:40,172 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-11-03 04:01:40,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:01:40,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2022-11-03 04:01:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:40,174 INFO L225 Difference]: With dead ends: 52 [2022-11-03 04:01:40,175 INFO L226 Difference]: Without dead ends: 31 [2022-11-03 04:01:40,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:01:40,177 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 61 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-11-03 04:01:40,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 61 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:01:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-03 04:01:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-03 04:01:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:01:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-11-03 04:01:40,186 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2022-11-03 04:01:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:40,187 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-11-03 04:01:40,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 04:01:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-11-03 04:01:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 04:01:40,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:40,189 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, 1] [2022-11-03 04:01:40,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 04:01:40,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:01:40,404 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:01:40,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:40,405 INFO L85 PathProgramCache]: Analyzing trace with hash 436872902, now seen corresponding path program 1 times [2022-11-03 04:01:40,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:01:40,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935674473] [2022-11-03 04:01:40,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:40,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:01:40,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:01:40,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:01:40,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 04:01:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:40,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 04:01:40,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:40,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:01:41,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-03 04:01:41,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:41,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-03 04:01:41,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 04:01:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:01:41,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:41,682 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:01:41,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935674473] [2022-11-03 04:01:41,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935674473] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:41,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1261372246] [2022-11-03 04:01:41,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:41,683 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:01:41,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:01:41,713 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:01:41,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-11-03 04:01:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:42,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 04:01:42,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:42,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:01:43,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:43,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:43,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14 [2022-11-03 04:01:43,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 04:01:43,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:43,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:43,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-03 04:01:43,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 04:01:43,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-03 04:01:43,210 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 04:01:43,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-03 04:01:43,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 04:01:43,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-03 04:01:43,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 04:01:43,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 04:01:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 04:01:43,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:01:43,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1261372246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:01:43,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:01:43,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2022-11-03 04:01:43,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166762266] [2022-11-03 04:01:43,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:01:43,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 04:01:43,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:01:43,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 04:01:43,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=568, Unknown=9, NotChecked=0, Total=650 [2022-11-03 04:01:43,663 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 04:01:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:44,077 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-11-03 04:01:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:01:44,079 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-11-03 04:01:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:44,080 INFO L225 Difference]: With dead ends: 34 [2022-11-03 04:01:44,080 INFO L226 Difference]: Without dead ends: 32 [2022-11-03 04:01:44,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=85, Invalid=661, Unknown=10, NotChecked=0, Total=756 [2022-11-03 04:01:44,082 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:01:44,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 120 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 77 Unchecked, 0.2s Time] [2022-11-03 04:01:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-03 04:01:44,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-03 04:01:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:01:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-03 04:01:44,091 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 32 [2022-11-03 04:01:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:44,092 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-03 04:01:44,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 04:01:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-03 04:01:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 04:01:44,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:44,094 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, 1, 1, 1, 1] [2022-11-03 04:01:44,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-03 04:01:44,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2022-11-03 04:01:44,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 04:01:44,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:01:44,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1130578833, now seen corresponding path program 1 times [2022-11-03 04:01:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:01:44,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105370000] [2022-11-03 04:01:44,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:44,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:01:44,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:01:44,499 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:01:44,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 04:01:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:44,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 04:01:44,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:45,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-03 04:01:45,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:45,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-03 04:01:45,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 04:01:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:01:45,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:45,575 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:01:45,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105370000] [2022-11-03 04:01:45,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105370000] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:45,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [112806303] [2022-11-03 04:01:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:45,576 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:01:45,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:01:45,578 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:01:45,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-03 04:01:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:45,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 04:01:45,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:46,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-03 04:01:46,468 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_383) |c_#memory_$Pointer$.base|)) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-11-03 04:01:46,538 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:01:46,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-03 04:01:46,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 04:01:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-03 04:01:46,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:46,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [112806303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:46,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908936169] [2022-11-03 04:01:46,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:46,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:46,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:01:46,832 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:01:46,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 04:01:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:47,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-03 04:01:47,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:47,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-03 04:01:47,219 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_453))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-11-03 04:01:47,287 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:01:47,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-11-03 04:01:47,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-03 04:01:47,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-03 04:01:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-03 04:01:47,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:47,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908936169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:47,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:01:47,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2022-11-03 04:01:47,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940608615] [2022-11-03 04:01:47,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:01:47,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 04:01:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:01:47,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 04:01:47,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=461, Unknown=10, NotChecked=90, Total=650 [2022-11-03 04:01:47,653 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 24 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 04:01:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:48,317 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-11-03 04:01:48,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:01:48,318 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 35 [2022-11-03 04:01:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:48,320 INFO L225 Difference]: With dead ends: 40 [2022-11-03 04:01:48,320 INFO L226 Difference]: Without dead ends: 30 [2022-11-03 04:01:48,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=124, Invalid=628, Unknown=12, NotChecked=106, Total=870 [2022-11-03 04:01:48,322 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:01:48,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 222 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 107 Unchecked, 0.4s Time] [2022-11-03 04:01:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-03 04:01:48,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-11-03 04:01:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 04:01:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-11-03 04:01:48,337 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 35 [2022-11-03 04:01:48,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:48,337 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-11-03 04:01:48,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 04:01:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-11-03 04:01:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 04:01:48,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:48,340 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, 1, 1, 1, 1] [2022-11-03 04:01:48,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 04:01:48,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-03 04:01:48,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-03 04:01:48,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 04:01:48,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:01:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:48,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1205420011, now seen corresponding path program 1 times [2022-11-03 04:01:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:01:48,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681935673] [2022-11-03 04:01:48,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:48,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:01:48,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:01:48,945 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:01:48,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 04:01:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:49,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 04:01:49,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:49,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:01:49,729 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:01:49,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:01:49,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:01:49,984 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:01:49,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-11-03 04:01:50,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-03 04:01:50,214 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-11-03 04:01:50,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 35 [2022-11-03 04:01:50,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:01:50,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:01:50,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:50,629 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 04:01:50,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2022-11-03 04:01:50,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:50,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 46 [2022-11-03 04:01:50,696 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-03 04:01:50,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-11-03 04:01:50,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-11-03 04:01:51,032 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-03 04:01:51,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2022-11-03 04:01:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:01:51,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:51,460 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:01:51,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681935673] [2022-11-03 04:01:51,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681935673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:51,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1185947456] [2022-11-03 04:01:51,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:51,461 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:01:51,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:01:51,462 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:01:51,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-11-03 04:01:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:52,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-03 04:01:52,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:52,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:01:53,012 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:01:53,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:01:53,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:01:53,503 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:01:53,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:01:53,886 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 04:01:53,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-11-03 04:01:53,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:01:53,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 04:01:56,467 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:01:56,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 04:01:56,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:56,545 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 04:01:56,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 53 [2022-11-03 04:01:56,589 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:01:56,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 04:01:57,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 04:01:57,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:57,452 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-03 04:01:57,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 28 [2022-11-03 04:01:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:01:57,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:58,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1185947456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:58,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752576018] [2022-11-03 04:01:58,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:58,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:58,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:01:58,115 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:01:58,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 04:01:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:58,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 04:01:58,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:58,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:01:58,695 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 04:01:58,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 04:01:59,316 INFO L356 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-03 04:01:59,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-03 04:01:59,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:01:59,799 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:01:59,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:02:00,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:00,707 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 04:02:00,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 61 [2022-11-03 04:02:00,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:00,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2022-11-03 04:02:00,778 INFO L356 Elim1Store]: treesize reduction 40, result has 42.0 percent of original size [2022-11-03 04:02:00,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 47 [2022-11-03 04:02:01,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 38 [2022-11-03 04:02:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:02:01,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:01,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_717 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|))) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_716))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_717) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))))) is different from false [2022-11-03 04:02:01,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752576018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:01,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:02:01,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 21] total 60 [2022-11-03 04:02:01,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834799406] [2022-11-03 04:02:01,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:01,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-03 04:02:01,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:01,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-03 04:02:01,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=3732, Unknown=14, NotChecked=124, Total=4160 [2022-11-03 04:02:01,883 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 60 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 45 states have internal predecessors, (76), 9 states have call successors, (9), 7 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-03 04:02:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:09,400 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-11-03 04:02:09,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 04:02:09,401 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 45 states have internal predecessors, (76), 9 states have call successors, (9), 7 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 35 [2022-11-03 04:02:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:09,402 INFO L225 Difference]: With dead ends: 54 [2022-11-03 04:02:09,402 INFO L226 Difference]: Without dead ends: 45 [2022-11-03 04:02:09,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2232 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=461, Invalid=5534, Unknown=15, NotChecked=152, Total=6162 [2022-11-03 04:02:09,405 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:09,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 432 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 287 Invalid, 0 Unknown, 147 Unchecked, 1.0s Time] [2022-11-03 04:02:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-03 04:02:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-03 04:02:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 04:02:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-11-03 04:02:09,419 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 35 [2022-11-03 04:02:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:09,420 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-11-03 04:02:09,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 45 states have internal predecessors, (76), 9 states have call successors, (9), 7 states have call predecessors, (9), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-03 04:02:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-11-03 04:02:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 04:02:09,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:09,422 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:09,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-11-03 04:02:09,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:09,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:10,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:10,037 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash 790772624, now seen corresponding path program 1 times [2022-11-03 04:02:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:10,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739551572] [2022-11-03 04:02:10,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:10,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:10,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:10,039 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:10,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-03 04:02:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:10,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-03 04:02:10,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:10,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:02:10,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 04:02:10,597 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:02:10,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:02:10,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:02:10,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:11,055 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-03 04:02:11,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-03 04:02:11,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 04:02:11,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:11,543 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:02:11,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2022-11-03 04:02:11,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:02:11,883 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-03 04:02:11,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 37 [2022-11-03 04:02:11,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 04:02:11,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 04:02:11,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-03 04:02:12,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:12,371 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 04:02:12,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 80 [2022-11-03 04:02:12,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:12,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2022-11-03 04:02:12,462 INFO L356 Elim1Store]: treesize reduction 18, result has 61.7 percent of original size [2022-11-03 04:02:12,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 47 [2022-11-03 04:02:12,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:02:14,248 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-03 04:02:14,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 88 [2022-11-03 04:02:14,365 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-03 04:02:14,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 244 treesize of output 147 [2022-11-03 04:02:14,403 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 04:02:14,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 163 [2022-11-03 04:02:14,461 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:02:14,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 165 [2022-11-03 04:02:14,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2022-11-03 04:02:14,742 INFO L356 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-11-03 04:02:14,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 40 [2022-11-03 04:02:14,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 04:02:14,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 04:02:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:02:15,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:15,364 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_810) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_808) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-03 04:02:15,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| (_ BitVec 32)) (v_ArrVal_806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_810) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_808) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-03 04:02:15,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| (_ BitVec 32)) (v_ArrVal_806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_810) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_808) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2022-11-03 04:02:15,596 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| (_ BitVec 32)) (v_ArrVal_806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_810) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_808) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_11| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-03 04:02:16,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:02:16,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739551572] [2022-11-03 04:02:16,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739551572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:16,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [552947950] [2022-11-03 04:02:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:16,480 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:02:16,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:02:16,489 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:02:16,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-11-03 04:02:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:17,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-03 04:02:17,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:17,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:02:18,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 04:02:18,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:18,746 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:02:18,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:02:19,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:19,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 04:02:19,488 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:02:19,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-11-03 04:02:19,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:02:20,251 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:02:20,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 36 [2022-11-03 04:02:20,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 04:02:20,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 04:02:20,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:02:20,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:20,808 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 04:02:20,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 73 [2022-11-03 04:02:20,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:20,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-11-03 04:02:20,874 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-03 04:02:20,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-11-03 04:02:20,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:02:22,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:22,856 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-03 04:02:22,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 134 treesize of output 111 [2022-11-03 04:02:22,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:22,928 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-03 04:02:22,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 98 [2022-11-03 04:02:22,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-11-03 04:02:23,542 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:02:23,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 33 [2022-11-03 04:02:23,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 04:02:23,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 04:02:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:23,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:23,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_912 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_914 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_911 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_913) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_914) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_915) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_911) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_916) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_912) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-03 04:02:23,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_912 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_914 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_913) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_914) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_915) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_911) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_916) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_912) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-03 04:02:23,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_912 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_914 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_913) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_914) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_915) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_911) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_916) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_912) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-03 04:02:23,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_912 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_914 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_913) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_914) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_915) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_911) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_916) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_912) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-03 04:02:24,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [552947950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:24,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101398342] [2022-11-03 04:02:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:24,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:24,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:24,985 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:24,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 04:02:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:25,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-03 04:02:25,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:25,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:02:25,881 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:02:25,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:02:26,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:26,814 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-03 04:02:26,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-03 04:02:27,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:27,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 04:02:27,504 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:02:27,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2022-11-03 04:02:27,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:02:28,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:28,842 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 04:02:28,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 80 [2022-11-03 04:02:28,879 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-03 04:02:28,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-03 04:02:28,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 04:02:28,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:28,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2022-11-03 04:02:28,984 INFO L356 Elim1Store]: treesize reduction 18, result has 61.7 percent of original size [2022-11-03 04:02:28,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 47 [2022-11-03 04:02:30,650 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-03 04:02:30,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 88 [2022-11-03 04:02:30,754 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-03 04:02:30,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 245 treesize of output 148 [2022-11-03 04:02:30,798 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 04:02:30,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 164 [2022-11-03 04:02:30,836 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:02:30,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 166 [2022-11-03 04:02:30,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2022-11-03 04:02:31,340 INFO L356 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-11-03 04:02:31,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 41 [2022-11-03 04:02:31,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 04:02:31,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 04:02:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:02:31,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:31,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1012) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1026) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-03 04:02:31,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| (_ BitVec 32)) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1012) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1026) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-03 04:02:31,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| (_ BitVec 32)) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1012) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1026) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-03 04:02:31,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| (_ BitVec 32)) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1012) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1026) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-03 04:02:32,055 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1035 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| (_ BitVec 32)) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1036 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1037 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1026 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| (_ BitVec 32)) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1037)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1036))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1035) .cse0 v_ArrVal_1012) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1026) (select (select (store (store .cse1 .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1017) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store .cse2 .cse0 (store (select .cse2 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_16| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33| v_ArrVal_1019) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_33|) (_ bv0 1))))) is different from false [2022-11-03 04:02:32,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101398342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:32,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:02:32,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 66 [2022-11-03 04:02:32,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676877452] [2022-11-03 04:02:32,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:32,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-03 04:02:32,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:32,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-03 04:02:32,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=4565, Unknown=29, NotChecked=1924, Total=6806 [2022-11-03 04:02:32,073 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 66 states, 60 states have (on average 1.4) internal successors, (84), 50 states have internal predecessors, (84), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-03 04:02:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:37,115 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-11-03 04:02:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 04:02:37,118 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 60 states have (on average 1.4) internal successors, (84), 50 states have internal predecessors, (84), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 37 [2022-11-03 04:02:37,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:37,119 INFO L225 Difference]: With dead ends: 54 [2022-11-03 04:02:37,119 INFO L226 Difference]: Without dead ends: 52 [2022-11-03 04:02:37,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=419, Invalid=6576, Unknown=29, NotChecked=2288, Total=9312 [2022-11-03 04:02:37,123 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:37,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 363 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 421 Invalid, 0 Unknown, 155 Unchecked, 1.4s Time] [2022-11-03 04:02:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-03 04:02:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-11-03 04:02:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 04:02:37,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-11-03 04:02:37,139 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 37 [2022-11-03 04:02:37,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:37,139 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-11-03 04:02:37,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 60 states have (on average 1.4) internal successors, (84), 50 states have internal predecessors, (84), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-03 04:02:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-11-03 04:02:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-03 04:02:37,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:37,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:37,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2022-11-03 04:02:37,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:37,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:37,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:37,748 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:37,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:37,749 INFO L85 PathProgramCache]: Analyzing trace with hash -718486453, now seen corresponding path program 2 times [2022-11-03 04:02:37,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:37,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197060161] [2022-11-03 04:02:37,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 04:02:37,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:37,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:37,751 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:37,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-03 04:02:38,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 04:02:38,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:02:38,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-03 04:02:38,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:38,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:02:38,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:38,724 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:02:38,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:02:38,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:38,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 04:02:38,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:39,103 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-03 04:02:39,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 54 [2022-11-03 04:02:39,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:02:39,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 04:02:39,482 INFO L356 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-11-03 04:02:39,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 69 [2022-11-03 04:02:39,509 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:02:39,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2022-11-03 04:02:39,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:02:39,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 04:02:39,973 INFO L356 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-03 04:02:39,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 126 [2022-11-03 04:02:39,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:40,050 INFO L356 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-03 04:02:40,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 104 [2022-11-03 04:02:40,111 INFO L356 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2022-11-03 04:02:40,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 04:02:40,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:02:40,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2022-11-03 04:02:40,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 145 [2022-11-03 04:02:42,152 INFO L356 Elim1Store]: treesize reduction 84, result has 15.2 percent of original size [2022-11-03 04:02:42,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 204 treesize of output 126 [2022-11-03 04:02:42,305 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-03 04:02:42,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 175 [2022-11-03 04:02:42,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-11-03 04:02:42,384 INFO L356 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2022-11-03 04:02:42,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 116 [2022-11-03 04:02:42,454 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-03 04:02:42,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 102 [2022-11-03 04:02:42,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 04:02:42,699 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:02:42,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 25 [2022-11-03 04:02:42,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 04:02:42,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 04:02:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 04:02:42,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:43,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1130 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1130)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1140) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1133) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-03 04:02:43,369 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1130 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1130)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1140) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1133) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-03 04:02:43,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1130 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1130)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1140) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1133) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))))) is different from false [2022-11-03 04:02:43,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1130 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (= (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1130)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1138) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1140) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1133) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-03 04:02:43,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1130 (_ BitVec 32)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)) (.cse3 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_1130)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1138) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1140) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1133) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-03 04:02:46,318 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:02:46,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197060161] [2022-11-03 04:02:46,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197060161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:46,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2133601594] [2022-11-03 04:02:46,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 04:02:46,319 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:02:46,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:02:46,320 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:02:46,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-11-03 04:02:46,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 04:02:46,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:02:47,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-03 04:02:47,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:47,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:02:47,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:48,197 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:02:48,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:02:48,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:48,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:48,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-03 04:02:48,856 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 04:02:48,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 54 [2022-11-03 04:02:48,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:02:48,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-11-03 04:02:49,511 INFO L356 Elim1Store]: treesize reduction 33, result has 10.8 percent of original size [2022-11-03 04:02:49,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 84 [2022-11-03 04:02:49,529 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:02:49,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2022-11-03 04:02:49,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-03 04:02:49,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 11 [2022-11-03 04:02:49,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-03 04:02:52,300 INFO L356 Elim1Store]: treesize reduction 122, result has 19.7 percent of original size [2022-11-03 04:02:52,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 169 treesize of output 123 [2022-11-03 04:02:52,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:52,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:52,353 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-03 04:02:52,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 72 [2022-11-03 04:02:52,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:52,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 04:02:52,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:52,417 INFO L356 Elim1Store]: treesize reduction 6, result has 70.0 percent of original size [2022-11-03 04:02:52,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-11-03 04:02:52,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 215 [2022-11-03 04:02:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:56,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:56,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1248 (_ BitVec 32)) (v_ArrVal_1247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1246 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1249 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1249))) (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| v_ArrVal_1248))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1247) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1246) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1251) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-03 04:03:01,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:01,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 555 treesize of output 556 [2022-11-03 04:03:15,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2133601594] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:03:15,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143964956] [2022-11-03 04:03:15,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 04:03:15,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:15,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:03:15,684 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:03:15,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 04:03:15,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 04:03:15,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:03:15,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-03 04:03:15,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:16,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:03:19,166 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:03:19,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:03:19,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:03:19,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:03:20,105 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-03 04:03:20,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 48 [2022-11-03 04:03:20,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 04:03:35,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:35,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:35,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:35,194 INFO L356 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-03 04:03:35,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 76 [2022-11-03 04:03:35,327 INFO L356 Elim1Store]: treesize reduction 114, result has 18.6 percent of original size [2022-11-03 04:03:35,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 85 [2022-11-03 04:03:35,388 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-03 04:03:35,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2022-11-03 04:03:41,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:41,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:41,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:41,191 INFO L356 Elim1Store]: treesize reduction 82, result has 7.9 percent of original size [2022-11-03 04:03:41,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 103 treesize of output 57 [2022-11-03 04:03:42,103 INFO L356 Elim1Store]: treesize reduction 179, result has 9.1 percent of original size [2022-11-03 04:03:42,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 80 treesize of output 57 [2022-11-03 04:03:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:03:42,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:47,548 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| (_ BitVec 32))) (or (forall ((v_ArrVal_1359 (_ BitVec 32)) (v_ArrVal_1360 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1360)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= .cse0 (_ bv0 32)) (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1359)))) (let ((.cse5 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (let ((.cse2 (select (select .cse1 .cse5) .cse0)) (.cse3 (select (select .cse4 .cse5) .cse0))) (select (select .cse1 (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))) .cse5)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42|))))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| (_ BitVec 32))) (or (forall ((v_ArrVal_1359 (_ BitVec 32)) (v_ArrVal_1360 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1359)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= .cse6 (_ bv0 32)) (not (= (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42|) (_ bv0 32) (_ bv0 32)) (_ bv4 32) v_ArrVal_1360)))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse8 (select (select .cse7 .cse6) .cse11)) (.cse9 (select (select .cse10 .cse6) .cse11))) (select (select .cse7 (select (select .cse7 .cse8) .cse9)) (select (select .cse10 .cse8) .cse9))))) .cse6)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_42|)))))) is different from false [2022-11-03 04:03:47,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143964956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:03:47,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:03:47,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 63 [2022-11-03 04:03:47,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420436099] [2022-11-03 04:03:47,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:03:47,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-03 04:03:47,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:03:47,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-03 04:03:47,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=6079, Unknown=33, NotChecked=1148, Total=7656 [2022-11-03 04:03:47,577 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 63 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 49 states have internal predecessors, (89), 8 states have call successors, (8), 6 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-03 04:03:58,276 WARN L234 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 73 DAG size of output: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:04:13,392 WARN L234 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 39 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:04:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:13,917 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-11-03 04:04:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 04:04:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 49 states have internal predecessors, (89), 8 states have call successors, (8), 6 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 39 [2022-11-03 04:04:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:13,919 INFO L225 Difference]: With dead ends: 62 [2022-11-03 04:04:13,919 INFO L226 Difference]: Without dead ends: 51 [2022-11-03 04:04:13,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3138 ImplicationChecksByTransitivity, 82.0s TimeCoverageRelationStatistics Valid=567, Invalid=7984, Unknown=33, NotChecked=1316, Total=9900 [2022-11-03 04:04:13,923 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:13,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 453 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 364 Invalid, 0 Unknown, 266 Unchecked, 1.6s Time] [2022-11-03 04:04:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-03 04:04:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-03 04:04:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.119047619047619) internal successors, (47), 43 states have internal predecessors, (47), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 04:04:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-11-03 04:04:13,940 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 39 [2022-11-03 04:04:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:13,941 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-11-03 04:04:13,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 49 states have internal predecessors, (89), 8 states have call successors, (8), 6 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-11-03 04:04:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-11-03 04:04:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 04:04:13,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:13,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:13,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:14,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:14,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:14,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:14,548 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:04:14,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:14,548 INFO L85 PathProgramCache]: Analyzing trace with hash 12485255, now seen corresponding path program 1 times [2022-11-03 04:04:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:04:14,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330909341] [2022-11-03 04:04:14,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:14,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:04:14,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:04:14,551 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:04:14,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-03 04:04:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:14,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-03 04:04:14,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:14,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:04:14,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 04:04:15,078 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:04:15,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:04:15,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:04:15,357 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-03 04:04:15,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-03 04:04:15,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:04:15,691 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:04:15,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-03 04:04:15,966 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-03 04:04:15,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 30 [2022-11-03 04:04:15,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-03 04:04:16,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:16,346 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 04:04:16,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 71 [2022-11-03 04:04:16,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:16,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 60 [2022-11-03 04:04:16,424 INFO L356 Elim1Store]: treesize reduction 18, result has 61.7 percent of original size [2022-11-03 04:04:16,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 47 [2022-11-03 04:04:17,659 INFO L356 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-03 04:04:17,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 72 [2022-11-03 04:04:17,777 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-03 04:04:17,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 196 treesize of output 121 [2022-11-03 04:04:17,826 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 04:04:17,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 131 [2022-11-03 04:04:17,879 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:04:17,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 127 [2022-11-03 04:04:18,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 91 [2022-11-03 04:04:18,597 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-03 04:04:18,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 36 [2022-11-03 04:04:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 04:04:18,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:04:19,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| (_ BitVec 32)) (v_ArrVal_1441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1446 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1441))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-03 04:04:19,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_34| (_ BitVec 32)) (v_ArrVal_1441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1446 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_34| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1441))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_34| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-03 04:04:19,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_34| (_ BitVec 32)) (v_ArrVal_1441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1446 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_34| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1441))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_34| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-03 04:04:19,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_34| (_ BitVec 32)) (v_ArrVal_1441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1446 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (_ BitVec 32))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_34| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1441))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_34| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-03 04:04:20,111 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:04:20,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330909341] [2022-11-03 04:04:20,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330909341] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:20,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [445306291] [2022-11-03 04:04:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:20,112 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:04:20,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:04:20,113 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:04:20,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-11-03 04:04:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:20,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-03 04:04:20,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:21,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:04:21,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 04:04:22,266 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:04:22,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:04:22,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:04:22,873 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:04:22,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-03 04:04:23,467 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:04:23,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2022-11-03 04:04:23,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:04:23,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 04:04:26,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:26,419 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 04:04:26,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 64 [2022-11-03 04:04:26,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:26,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 67 [2022-11-03 04:04:26,501 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-03 04:04:26,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 04:04:29,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,077 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-03 04:04:30,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 154 treesize of output 123 [2022-11-03 04:04:30,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,194 INFO L356 Elim1Store]: treesize reduction 124, result has 17.3 percent of original size [2022-11-03 04:04:30,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 65 [2022-11-03 04:04:30,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:30,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-03 04:04:31,605 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-03 04:04:31,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 43 [2022-11-03 04:04:31,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 13 [2022-11-03 04:04:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:04:32,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:04:32,932 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1536 (_ BitVec 32)) (v_ArrVal_1537 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1535) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1537)) (.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1536)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1538))) (let ((.cse0 (select (select .cse1 |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|))) (or (not (= .cse0 (select (select .cse1 .cse2) .cse0))) (not (= (select (select .cse3 .cse2) .cse0) .cse2)))))) is different from false [2022-11-03 04:05:06,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [445306291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:06,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823347602] [2022-11-03 04:05:06,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:06,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:06,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:06,649 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:06,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 04:05:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:06,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-03 04:05:06,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:06,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:05:08,350 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:05:08,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:05:10,494 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-03 04:05:10,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-03 04:05:11,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:05:11,708 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:05:11,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2022-11-03 04:05:11,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-03 04:05:24,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:24,778 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-03 04:05:24,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 58 [2022-11-03 04:05:24,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:24,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 68 [2022-11-03 04:05:24,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:24,879 INFO L356 Elim1Store]: treesize reduction 18, result has 58.1 percent of original size [2022-11-03 04:05:24,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 43 [2022-11-03 04:05:29,742 INFO L356 Elim1Store]: treesize reduction 159, result has 13.6 percent of original size [2022-11-03 04:05:29,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 163 treesize of output 92 [2022-11-03 04:05:29,841 INFO L356 Elim1Store]: treesize reduction 86, result has 18.9 percent of original size [2022-11-03 04:05:29,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 198 treesize of output 123 [2022-11-03 04:05:29,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 69 [2022-11-03 04:05:29,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2022-11-03 04:05:30,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2022-11-03 04:05:31,675 INFO L356 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-11-03 04:05:31,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 41 [2022-11-03 04:05:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:05:32,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:32,279 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1631 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1631))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-03 04:06:00,466 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1631 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| (_ BitVec 32))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| .cse2))) (or (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1631))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) (not (= (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_40|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))))) is different from false [2022-11-03 04:08:08,542 WARN L234 SmtUtils]: Spent 10.19s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:08:08,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823347602] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:08,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:08,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29, 27] total 75 [2022-11-03 04:08:08,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312692632] [2022-11-03 04:08:08,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:08,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-03 04:08:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:08:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-03 04:08:08,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=8424, Unknown=91, NotChecked=1344, Total=10302 [2022-11-03 04:08:08,548 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 75 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 59 states have internal predecessors, (92), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-03 04:08:24,401 WARN L234 SmtUtils]: Spent 8.59s on a formula simplification. DAG size of input: 63 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:09:06,395 WARN L234 SmtUtils]: Spent 8.41s on a formula simplification. DAG size of input: 39 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:09:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:20,535 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-11-03 04:09:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 04:09:20,536 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 59 states have internal predecessors, (92), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 40 [2022-11-03 04:09:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:20,538 INFO L225 Difference]: With dead ends: 57 [2022-11-03 04:09:20,538 INFO L226 Difference]: Without dead ends: 54 [2022-11-03 04:09:20,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 4254 ImplicationChecksByTransitivity, 289.2s TimeCoverageRelationStatistics Valid=699, Invalid=12808, Unknown=93, NotChecked=1652, Total=15252 [2022-11-03 04:09:20,543 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:20,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 420 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 401 Invalid, 0 Unknown, 219 Unchecked, 5.2s Time] [2022-11-03 04:09:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-03 04:09:20,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-11-03 04:09:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 45 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-03 04:09:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-11-03 04:09:20,556 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 40 [2022-11-03 04:09:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:20,556 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-11-03 04:09:20,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 59 states have internal predecessors, (92), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-03 04:09:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-11-03 04:09:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 04:09:20,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:20,558 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:20,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:20,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:20,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:21,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:09:21,164 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:09:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:21,165 INFO L85 PathProgramCache]: Analyzing trace with hash 387084070, now seen corresponding path program 1 times [2022-11-03 04:09:21,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:09:21,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975551969] [2022-11-03 04:09:21,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:21,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:09:21,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:09:21,166 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:09:21,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-03 04:09:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:21,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-03 04:09:21,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:21,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:09:22,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:09:25,206 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:09:25,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 04:09:25,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 04:09:25,565 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:09:25,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:09:26,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:09:26,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 04:09:26,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:09:27,348 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:09:27,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 63 [2022-11-03 04:09:27,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:27,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-03 04:09:28,947 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-11-03 04:09:28,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 53 [2022-11-03 04:09:29,004 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:09:29,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-11-03 04:09:29,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:09:29,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 04:09:31,632 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-03 04:09:31,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 85 [2022-11-03 04:09:31,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:31,903 INFO L356 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2022-11-03 04:09:31,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 73 [2022-11-03 04:09:31,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:31,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 04:09:32,206 INFO L356 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2022-11-03 04:09:32,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 04:09:32,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2022-11-03 04:09:32,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2022-11-03 04:09:33,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2022-11-03 04:09:38,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:40,315 INFO L356 Elim1Store]: treesize reduction 268, result has 18.0 percent of original size [2022-11-03 04:09:40,316 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:09:40,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975551969] [2022-11-03 04:09:40,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: var is still there: |v_#memory_$Pointer$.base_194| input size 101 context size 101 output size 101 [2022-11-03 04:09:40,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [193545350] [2022-11-03 04:09:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:40,317 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:09:40,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:09:40,318 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:09:40,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-11-03 04:09:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:40,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-03 04:09:40,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:09:41,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:09:41,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:09:44,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-03 04:09:44,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 04:09:47,342 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:09:47,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:09:47,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 04:09:48,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 04:09:48,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:09:48,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:09:50,166 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:09:50,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 68 [2022-11-03 04:09:50,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:09:50,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-03 04:09:52,541 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:09:52,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 47 [2022-11-03 04:09:52,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-11-03 04:09:52,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 04:09:52,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:09:55,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:55,685 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-03 04:09:55,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 90 [2022-11-03 04:09:55,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:55,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:09:55,787 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:09:55,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 97 [2022-11-03 04:09:56,028 INFO L356 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2022-11-03 04:09:56,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 44 [2022-11-03 04:09:56,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 04:09:56,392 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-03 04:09:56,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-11-03 04:10:01,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:02,202 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-03 04:10:02,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 186 treesize of output 149 [2022-11-03 04:10:02,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:02,619 INFO L356 Elim1Store]: treesize reduction 66, result has 23.3 percent of original size [2022-11-03 04:10:02,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 164 treesize of output 150 [2022-11-03 04:10:02,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2022-11-03 04:10:02,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 04:10:06,231 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:10:06,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 55 [2022-11-03 04:10:06,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 30 treesize of output 13 [2022-11-03 04:10:07,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 04:10:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:10:08,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:10:10,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1850 (_ BitVec 32)) (v_ArrVal_1852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1854) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1851)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1855) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1852))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_1850)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1853) (select (select .cse0 .cse1) .cse2)) (bvadd (_ bv4 32) (select (select .cse3 .cse1) .cse2))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-03 04:10:11,139 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1850 (_ BitVec 32)) (v_ArrVal_1852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1854) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1851)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1855) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1852))) (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 |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) v_ArrVal_1850)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1853) (select (select .cse1 .cse2) .cse3)) (bvadd (_ bv4 32) (select (select .cse4 .cse2) .cse3)))))))) is different from false [2022-11-03 04:10:11,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1850 (_ BitVec 32)) (v_ArrVal_1852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1854) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1851)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1855) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1852))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) v_ArrVal_1850)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1853) (select (select .cse3 .cse4) .cse5)) (bvadd (_ bv4 32) (select (select .cse6 .cse4) .cse5))))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-03 04:10:11,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1850 (_ BitVec 32)) (v_ArrVal_1852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) .cse2))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1854) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1851)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1855) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1852))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| .cse1) .cse2) v_ArrVal_1850)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1853) (select (select .cse3 .cse4) .cse5)) (bvadd (select (select .cse6 .cse4) .cse5) (_ bv4 32))))))))) is different from false [2022-11-03 04:10:14,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [193545350] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:10:14,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25155695] [2022-11-03 04:10:14,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:10:14,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:10:14,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:10:14,738 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:10:14,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f199ba-ca17-475b-9a0a-4429ab417482/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 04:10:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:10:14,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 108 conjunts are in the unsatisfiable core [2022-11-03 04:10:14,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:15,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:10:17,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:10:18,851 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:10:18,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 04:10:24,385 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 04:10:24,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 04:10:24,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 04:10:24,953 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-03 04:10:24,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-03 04:10:26,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:10:26,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:10:26,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 04:10:28,199 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:10:28,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 73 [2022-11-03 04:10:28,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-11-03 04:10:28,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 04:10:48,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:49,124 INFO L356 Elim1Store]: treesize reduction 99, result has 10.0 percent of original size [2022-11-03 04:10:49,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 80 [2022-11-03 04:10:49,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:49,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:10:49,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 97 [2022-11-03 04:10:49,536 INFO L356 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2022-11-03 04:10:49,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 44 [2022-11-03 04:10:49,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 04:10:50,027 INFO L356 Elim1Store]: treesize reduction 18, result has 61.7 percent of original size [2022-11-03 04:10:50,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 47 [2022-11-03 04:10:59,054 INFO L356 Elim1Store]: treesize reduction 124, result has 17.3 percent of original size [2022-11-03 04:10:59,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 277 treesize of output 154 [2022-11-03 04:10:59,600 INFO L356 Elim1Store]: treesize reduction 86, result has 18.9 percent of original size [2022-11-03 04:10:59,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 436 treesize of output 283 [2022-11-03 04:11:00,025 INFO L356 Elim1Store]: treesize reduction 108, result has 19.4 percent of original size [2022-11-03 04:11:00,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 391 treesize of output 247 [2022-11-03 04:11:00,317 INFO L356 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-03 04:11:00,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 347 treesize of output 253 [2022-11-03 04:11:00,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 88 [2022-11-03 04:11:00,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 56 [2022-11-03 04:11:08,745 INFO L356 Elim1Store]: treesize reduction 68, result has 77.1 percent of original size [2022-11-03 04:11:08,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 403 treesize of output 377 [2022-11-03 04:11:08,912 INFO L244 Elim1Store]: Index analysis took 128 ms