./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8 --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d155cc00d5c2ba6f5ef1d5e883c6d133605de01ed97e4300960f893025d81fd1 --- 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-e04fb08 [2022-11-16 11:45:51,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:45:51,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:45:51,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:45:51,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:45:51,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:45:51,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:45:51,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:45:51,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:45:51,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:45:51,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:45:51,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:45:51,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:45:51,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:45:51,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:45:51,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:45:51,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:45:51,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:45:51,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:45:51,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:45:51,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:45:51,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:45:51,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:45:51,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:45:51,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:45:51,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:45:51,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:45:51,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:45:51,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:45:51,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:45:51,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:45:51,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:45:51,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:45:51,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:45:51,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:45:51,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:45:51,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:45:51,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:45:51,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:45:51,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:45:51,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:45:51,672 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 11:45:51,700 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:45:51,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:45:51,701 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:45:51,701 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:45:51,702 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:45:51,702 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:45:51,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:45:51,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:45:51,704 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:45:51,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:45:51,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:45:51,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:45:51,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:45:51,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:45:51,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:45:51,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:45:51,706 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:45:51,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:45:51,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:45:51,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:45:51,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:45:51,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:45:51,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:45:51,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:45:51,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:45:51,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:45:51,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:45:51,709 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:45:51,709 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:45:51,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:45:51,710 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_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/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_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d155cc00d5c2ba6f5ef1d5e883c6d133605de01ed97e4300960f893025d81fd1 [2022-11-16 11:45:52,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:45:52,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:45:52,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:45:52,043 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:45:52,044 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:45:52,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i [2022-11-16 11:45:52,120 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/data/f13469fe4/2f02670b0a424777be0d16568a55d437/FLAGbae31628a [2022-11-16 11:45:52,935 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:45:52,936 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i [2022-11-16 11:45:52,964 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/data/f13469fe4/2f02670b0a424777be0d16568a55d437/FLAGbae31628a [2022-11-16 11:45:53,436 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/data/f13469fe4/2f02670b0a424777be0d16568a55d437 [2022-11-16 11:45:53,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:45:53,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:45:53,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:45:53,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:45:53,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:45:53,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:45:53" (1/1) ... [2022-11-16 11:45:53,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f100cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:53, skipping insertion in model container [2022-11-16 11:45:53,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:45:53" (1/1) ... [2022-11-16 11:45:53,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:45:53,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:45:53,854 WARN L229 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_779af1cd-321e-4068-b216-6ab6f9c16c30/sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i[4499,4512] [2022-11-16 11:45:53,860 WARN L229 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_779af1cd-321e-4068-b216-6ab6f9c16c30/sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i[4559,4572] [2022-11-16 11:45:54,772 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:54,774 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:54,775 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:54,777 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:54,780 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:54,792 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:54,793 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:54,795 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:54,796 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:54,798 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:54,799 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:54,800 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:54,800 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,101 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 11:45:55,103 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 11:45:55,104 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 11:45:55,105 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 11:45:55,107 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 11:45:55,108 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 11:45:55,109 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 11:45:55,109 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 11:45:55,110 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 11:45:55,111 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 11:45:55,281 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 11:45:55,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:45:55,360 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:45:55,389 WARN L229 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_779af1cd-321e-4068-b216-6ab6f9c16c30/sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i[4499,4512] [2022-11-16 11:45:55,391 WARN L229 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_779af1cd-321e-4068-b216-6ab6f9c16c30/sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i[4559,4572] [2022-11-16 11:45:55,450 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,450 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,457 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,457 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,458 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,467 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,483 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,484 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,484 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,485 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,486 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,487 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,487 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:45:55,520 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 11:45:55,521 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 11:45:55,522 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 11:45:55,523 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 11:45:55,524 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 11:45:55,525 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 11:45:55,525 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 11:45:55,526 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 11:45:55,526 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 11:45:55,527 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 11:45:55,550 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 11:45:55,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:45:55,819 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:45:55,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55 WrapperNode [2022-11-16 11:45:55,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:45:55,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:45:55,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:45:55,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:45:55,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55" (1/1) ... [2022-11-16 11:45:55,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55" (1/1) ... [2022-11-16 11:45:55,968 INFO L138 Inliner]: procedures = 679, calls = 1048, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 150 [2022-11-16 11:45:55,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:45:55,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:45:55,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:45:55,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:45:55,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55" (1/1) ... [2022-11-16 11:45:55,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55" (1/1) ... [2022-11-16 11:45:55,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55" (1/1) ... [2022-11-16 11:45:55,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55" (1/1) ... [2022-11-16 11:45:56,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55" (1/1) ... [2022-11-16 11:45:56,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55" (1/1) ... [2022-11-16 11:45:56,009 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55" (1/1) ... [2022-11-16 11:45:56,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55" (1/1) ... [2022-11-16 11:45:56,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:45:56,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:45:56,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:45:56,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:45:56,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55" (1/1) ... [2022-11-16 11:45:56,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:45:56,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:45:56,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:45:56,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:45:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:45:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 11:45:56,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 11:45:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-16 11:45:56,114 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-16 11:45:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:45:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-16 11:45:56,116 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-16 11:45:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:45:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:45:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2022-11-16 11:45:56,119 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2022-11-16 11:45:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:45:56,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:45:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 11:45:56,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 11:45:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:45:56,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:45:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:45:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-16 11:45:56,121 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-16 11:45:56,121 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-16 11:45:56,121 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-16 11:45:56,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:45:56,439 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:45:56,441 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:45:56,913 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:45:56,926 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:45:56,929 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 11:45:56,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:45:56 BoogieIcfgContainer [2022-11-16 11:45:56,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:45:56,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:45:56,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:45:56,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:45:56,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:45:53" (1/3) ... [2022-11-16 11:45:56,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3067a0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:45:56, skipping insertion in model container [2022-11-16 11:45:56,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:45:55" (2/3) ... [2022-11-16 11:45:56,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3067a0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:45:56, skipping insertion in model container [2022-11-16 11:45:56,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:45:56" (3/3) ... [2022-11-16 11:45:56,946 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_back_harness.i [2022-11-16 11:45:56,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:45:56,973 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:45:57,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:45:57,051 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=PETRI_NET, 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;@4a20790e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:45:57,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:45:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-16 11:45:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 11:45:57,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:57,068 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:57,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:45:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash 524704703, now seen corresponding path program 1 times [2022-11-16 11:45:57,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:57,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311084487] [2022-11-16 11:45:57,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:57,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:57,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:45:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:57,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:45:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:57,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:57,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 11:45:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:57,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:45:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:57,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 11:45:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:57,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 11:45:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:57,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-16 11:45:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:57,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-16 11:45:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 11:45:57,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:57,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311084487] [2022-11-16 11:45:57,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311084487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:57,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:57,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:45:57,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476618678] [2022-11-16 11:45:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:57,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:45:57,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:57,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:45:57,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:45:57,929 INFO L87 Difference]: Start difference. First operand has 102 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-16 11:45:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:58,023 INFO L93 Difference]: Finished difference Result 208 states and 310 transitions. [2022-11-16 11:45:58,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:45:58,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2022-11-16 11:45:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:58,036 INFO L225 Difference]: With dead ends: 208 [2022-11-16 11:45:58,037 INFO L226 Difference]: Without dead ends: 109 [2022-11-16 11:45:58,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-16 11:45:58,045 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 21 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:58,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 398 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:45:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-16 11:45:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2022-11-16 11:45:58,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-16 11:45:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2022-11-16 11:45:58,100 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 73 [2022-11-16 11:45:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:58,101 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2022-11-16 11:45:58,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-16 11:45:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2022-11-16 11:45:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 11:45:58,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:58,105 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:58,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:45:58,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:45:58,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -125862913, now seen corresponding path program 1 times [2022-11-16 11:45:58,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:58,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886028988] [2022-11-16 11:45:58,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:58,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:58,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:45:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:58,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:45:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 11:45:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:58,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:45:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:58,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 11:45:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:58,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 11:45:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:58,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-16 11:45:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:58,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-16 11:45:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 11:45:58,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:58,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886028988] [2022-11-16 11:45:58,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886028988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:58,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:58,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:45:58,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128444765] [2022-11-16 11:45:58,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:58,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:45:58,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:58,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:45:58,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:45:58,701 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-16 11:45:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:58,788 INFO L93 Difference]: Finished difference Result 192 states and 265 transitions. [2022-11-16 11:45:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:45:58,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2022-11-16 11:45:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:58,794 INFO L225 Difference]: With dead ends: 192 [2022-11-16 11:45:58,796 INFO L226 Difference]: Without dead ends: 107 [2022-11-16 11:45:58,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-16 11:45:58,802 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 12 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:58,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 380 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:45:58,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-16 11:45:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2022-11-16 11:45:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 66 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-16 11:45:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2022-11-16 11:45:58,829 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 73 [2022-11-16 11:45:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:58,830 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2022-11-16 11:45:58,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-16 11:45:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2022-11-16 11:45:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 11:45:58,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:58,841 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:58,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:45:58,842 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:45:58,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2140518273, now seen corresponding path program 1 times [2022-11-16 11:45:58,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:58,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200657444] [2022-11-16 11:45:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:45:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:45:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:45:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 11:45:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:45:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 11:45:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 11:45:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-16 11:45:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-16 11:45:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:45:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 11:45:59,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:45:59,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200657444] [2022-11-16 11:45:59,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200657444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:45:59,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:45:59,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:45:59,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274297602] [2022-11-16 11:45:59,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:45:59,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:45:59,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:45:59,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:45:59,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:45:59,427 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-16 11:45:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:45:59,594 INFO L93 Difference]: Finished difference Result 192 states and 263 transitions. [2022-11-16 11:45:59,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:45:59,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-11-16 11:45:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:45:59,601 INFO L225 Difference]: With dead ends: 192 [2022-11-16 11:45:59,601 INFO L226 Difference]: Without dead ends: 105 [2022-11-16 11:45:59,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:45:59,609 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 22 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:45:59,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 555 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:45:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-16 11:45:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-11-16 11:45:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-16 11:45:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2022-11-16 11:45:59,637 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 73 [2022-11-16 11:45:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:45:59,639 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2022-11-16 11:45:59,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-16 11:45:59,640 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2022-11-16 11:45:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 11:45:59,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:45:59,643 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:45:59,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:45:59,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:45:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:45:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2124999555, now seen corresponding path program 1 times [2022-11-16 11:45:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:45:59,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634751747] [2022-11-16 11:45:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:45:59,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:45:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 11:46:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:46:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 11:46:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 11:46:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-16 11:46:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-16 11:46:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 11:46:00,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:00,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634751747] [2022-11-16 11:46:00,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634751747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:00,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:00,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:46:00,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577991098] [2022-11-16 11:46:00,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:00,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:46:00,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:00,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:46:00,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:46:00,230 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-16 11:46:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:00,334 INFO L93 Difference]: Finished difference Result 201 states and 268 transitions. [2022-11-16 11:46:00,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:46:00,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-11-16 11:46:00,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:00,336 INFO L225 Difference]: With dead ends: 201 [2022-11-16 11:46:00,336 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 11:46:00,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:46:00,339 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 28 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:00,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 560 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:46:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 11:46:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-16 11:46:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-16 11:46:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2022-11-16 11:46:00,364 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 73 [2022-11-16 11:46:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:00,364 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2022-11-16 11:46:00,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-16 11:46:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2022-11-16 11:46:00,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 11:46:00,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:00,366 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:00,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:46:00,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:00,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:00,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1956548997, now seen corresponding path program 1 times [2022-11-16 11:46:00,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:00,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012935294] [2022-11-16 11:46:00,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:00,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 11:46:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:46:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 11:46:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 11:46:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-16 11:46:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-16 11:46:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-16 11:46:00,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:00,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012935294] [2022-11-16 11:46:00,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012935294] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:00,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037028985] [2022-11-16 11:46:00,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:00,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:00,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:01,006 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:01,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:46:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:01,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 11:46:01,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-16 11:46:01,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:46:01,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037028985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:01,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:46:01,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 11 [2022-11-16 11:46:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131241975] [2022-11-16 11:46:01,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:01,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:46:01,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:01,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:46:01,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:46:01,527 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-16 11:46:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:01,872 INFO L93 Difference]: Finished difference Result 194 states and 259 transitions. [2022-11-16 11:46:01,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:46:01,873 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 73 [2022-11-16 11:46:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:01,875 INFO L225 Difference]: With dead ends: 194 [2022-11-16 11:46:01,876 INFO L226 Difference]: Without dead ends: 106 [2022-11-16 11:46:01,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:46:01,877 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 130 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:01,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 675 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:46:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-16 11:46:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-11-16 11:46:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.208955223880597) internal successors, (81), 69 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-11-16 11:46:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2022-11-16 11:46:01,890 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 73 [2022-11-16 11:46:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:01,891 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2022-11-16 11:46:01,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-16 11:46:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2022-11-16 11:46:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 11:46:01,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:01,893 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:01,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 11:46:02,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:02,100 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:02,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:02,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1237560575, now seen corresponding path program 1 times [2022-11-16 11:46:02,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:02,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553939198] [2022-11-16 11:46:02,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:02,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:02,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:02,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:02,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:02,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:46:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:02,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:46:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:02,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:46:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:02,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 11:46:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:02,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:46:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:46:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 11:46:02,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:02,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553939198] [2022-11-16 11:46:02,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553939198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:02,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:02,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:46:02,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714206223] [2022-11-16 11:46:02,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:02,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:46:02,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:02,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:46:02,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:46:02,626 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-16 11:46:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:02,745 INFO L93 Difference]: Finished difference Result 194 states and 262 transitions. [2022-11-16 11:46:02,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:46:02,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 75 [2022-11-16 11:46:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:02,747 INFO L225 Difference]: With dead ends: 194 [2022-11-16 11:46:02,748 INFO L226 Difference]: Without dead ends: 104 [2022-11-16 11:46:02,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:46:02,750 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 65 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:02,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 511 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:46:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-16 11:46:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-16 11:46:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 69 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-11-16 11:46:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2022-11-16 11:46:02,767 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 75 [2022-11-16 11:46:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:02,768 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2022-11-16 11:46:02,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-16 11:46:02,768 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2022-11-16 11:46:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 11:46:02,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:02,776 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:02,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:46:02,776 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1187141198, now seen corresponding path program 1 times [2022-11-16 11:46:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:02,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679606790] [2022-11-16 11:46:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:46:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-16 11:46:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-16 11:46:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:46:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 11:46:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:46:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 11:46:03,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:03,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679606790] [2022-11-16 11:46:03,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679606790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:03,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:03,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:46:03,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303179980] [2022-11-16 11:46:03,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:03,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:46:03,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:03,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:46:03,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:46:03,255 INFO L87 Difference]: Start difference. First operand 104 states and 137 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-16 11:46:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:03,341 INFO L93 Difference]: Finished difference Result 199 states and 268 transitions. [2022-11-16 11:46:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:46:03,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2022-11-16 11:46:03,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:03,345 INFO L225 Difference]: With dead ends: 199 [2022-11-16 11:46:03,345 INFO L226 Difference]: Without dead ends: 109 [2022-11-16 11:46:03,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:46:03,348 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 26 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:03,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 426 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:46:03,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-16 11:46:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2022-11-16 11:46:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-11-16 11:46:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2022-11-16 11:46:03,369 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 77 [2022-11-16 11:46:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:03,369 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2022-11-16 11:46:03,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-16 11:46:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2022-11-16 11:46:03,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-16 11:46:03,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:03,371 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:03,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:46:03,371 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:03,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:03,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1548809988, now seen corresponding path program 1 times [2022-11-16 11:46:03,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:03,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070434880] [2022-11-16 11:46:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:03,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 11:46:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-16 11:46:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-16 11:46:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 11:46:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 11:46:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 11:46:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 11:46:03,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:03,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070434880] [2022-11-16 11:46:03,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070434880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:03,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:03,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:46:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348241449] [2022-11-16 11:46:03,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:03,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:46:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:03,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:46:03,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:46:03,843 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-16 11:46:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:03,930 INFO L93 Difference]: Finished difference Result 202 states and 273 transitions. [2022-11-16 11:46:03,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:46:03,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2022-11-16 11:46:03,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:03,932 INFO L225 Difference]: With dead ends: 202 [2022-11-16 11:46:03,932 INFO L226 Difference]: Without dead ends: 111 [2022-11-16 11:46:03,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:46:03,933 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 23 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:03,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 434 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:46:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-16 11:46:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-11-16 11:46:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 71 states have internal predecessors, (82), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-11-16 11:46:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2022-11-16 11:46:03,947 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 78 [2022-11-16 11:46:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:03,948 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2022-11-16 11:46:03,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-16 11:46:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2022-11-16 11:46:03,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-16 11:46:03,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:03,949 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:03,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:46:03,950 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:03,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:03,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1185344546, now seen corresponding path program 1 times [2022-11-16 11:46:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:03,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591875936] [2022-11-16 11:46:03,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:03,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:04,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:04,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:04,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:04,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:46:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:04,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 11:46:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:04,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:46:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 11:46:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:04,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 11:46:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:04,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 11:46:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:04,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-16 11:46:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-16 11:46:04,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:04,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591875936] [2022-11-16 11:46:04,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591875936] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:04,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125841751] [2022-11-16 11:46:04,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:04,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:04,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:04,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:04,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:46:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:04,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 11:46:04,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-16 11:46:05,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:46:05,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125841751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:05,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:46:05,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 12 [2022-11-16 11:46:05,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587951878] [2022-11-16 11:46:05,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:05,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:46:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:05,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:46:05,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:46:05,009 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 11:46:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:05,368 INFO L93 Difference]: Finished difference Result 203 states and 268 transitions. [2022-11-16 11:46:05,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:46:05,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 86 [2022-11-16 11:46:05,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:05,369 INFO L225 Difference]: With dead ends: 203 [2022-11-16 11:46:05,370 INFO L226 Difference]: Without dead ends: 111 [2022-11-16 11:46:05,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:46:05,371 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 132 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:05,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 671 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:46:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-16 11:46:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2022-11-16 11:46:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 72 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-11-16 11:46:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2022-11-16 11:46:05,383 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 86 [2022-11-16 11:46:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:05,383 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2022-11-16 11:46:05,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 11:46:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2022-11-16 11:46:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-16 11:46:05,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:05,385 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:05,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:05,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 11:46:05,592 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash 172862485, now seen corresponding path program 1 times [2022-11-16 11:46:05,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:05,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791183980] [2022-11-16 11:46:05,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:05,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:46:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:46:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 11:46:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:46:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 11:46:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-16 11:46:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:46:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:06,550 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 11:46:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:06,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791183980] [2022-11-16 11:46:06,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791183980] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:06,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:06,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:46:06,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319897682] [2022-11-16 11:46:06,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:06,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:46:06,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:46:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:46:06,552 INFO L87 Difference]: Start difference. First operand 107 states and 140 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-16 11:46:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:06,930 INFO L93 Difference]: Finished difference Result 214 states and 288 transitions. [2022-11-16 11:46:06,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:46:06,931 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2022-11-16 11:46:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:06,932 INFO L225 Difference]: With dead ends: 214 [2022-11-16 11:46:06,932 INFO L226 Difference]: Without dead ends: 121 [2022-11-16 11:46:06,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:46:06,933 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 30 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:06,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 755 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:46:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-16 11:46:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2022-11-16 11:46:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 76 states have internal predecessors, (88), 28 states have call successors, (28), 7 states have call predecessors, (28), 9 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2022-11-16 11:46:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2022-11-16 11:46:06,949 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 88 [2022-11-16 11:46:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:06,949 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2022-11-16 11:46:06,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-16 11:46:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2022-11-16 11:46:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-16 11:46:06,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:06,951 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:06,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:46:06,951 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:06,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1559647895, now seen corresponding path program 1 times [2022-11-16 11:46:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:06,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019822096] [2022-11-16 11:46:06,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:06,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:07,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:07,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:07,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:46:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:07,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:46:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:07,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 11:46:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:46:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 11:46:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:07,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-16 11:46:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:07,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:46:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 11:46:07,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:07,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019822096] [2022-11-16 11:46:07,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019822096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:07,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248297752] [2022-11-16 11:46:07,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:07,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:07,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:07,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:07,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:46:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:08,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 11:46:08,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:08,215 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:46:08,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 11:46:08,238 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:46:08,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-16 11:46:10,633 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2022-11-16 11:46:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-16 11:46:10,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 11:46:10,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248297752] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:46:10,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:46:10,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 19 [2022-11-16 11:46:10,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179195789] [2022-11-16 11:46:10,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:46:10,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:46:10,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:10,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:46:10,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2022-11-16 11:46:10,999 INFO L87 Difference]: Start difference. First operand 112 states and 148 transitions. Second operand has 19 states, 18 states have (on average 4.611111111111111) internal successors, (83), 19 states have internal predecessors, (83), 6 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-16 11:46:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:11,697 INFO L93 Difference]: Finished difference Result 247 states and 339 transitions. [2022-11-16 11:46:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:46:11,697 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.611111111111111) internal successors, (83), 19 states have internal predecessors, (83), 6 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) Word has length 88 [2022-11-16 11:46:11,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:11,699 INFO L225 Difference]: With dead ends: 247 [2022-11-16 11:46:11,699 INFO L226 Difference]: Without dead ends: 149 [2022-11-16 11:46:11,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=116, Invalid=487, Unknown=1, NotChecked=46, Total=650 [2022-11-16 11:46:11,700 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 239 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:11,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 946 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 330 Invalid, 0 Unknown, 199 Unchecked, 0.4s Time] [2022-11-16 11:46:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-16 11:46:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 120. [2022-11-16 11:46:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.2) internal successors, (96), 83 states have internal predecessors, (96), 29 states have call successors, (29), 8 states have call predecessors, (29), 10 states have return successors, (35), 28 states have call predecessors, (35), 28 states have call successors, (35) [2022-11-16 11:46:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 160 transitions. [2022-11-16 11:46:11,718 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 160 transitions. Word has length 88 [2022-11-16 11:46:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:11,719 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 160 transitions. [2022-11-16 11:46:11,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.611111111111111) internal successors, (83), 19 states have internal predecessors, (83), 6 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (20), 5 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-16 11:46:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 160 transitions. [2022-11-16 11:46:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-16 11:46:11,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:11,720 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:11,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:11,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 11:46:11,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:11,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash 759251201, now seen corresponding path program 1 times [2022-11-16 11:46:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:11,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977478430] [2022-11-16 11:46:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:11,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:18,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:18,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:18,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:18,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:46:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:18,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:46:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:18,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:46:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:18,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:46:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:18,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:46:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:46:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:18,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:46:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-16 11:46:18,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:18,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977478430] [2022-11-16 11:46:18,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977478430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:18,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:18,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-16 11:46:18,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731332698] [2022-11-16 11:46:18,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:18,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 11:46:18,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:18,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 11:46:18,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:46:18,790 INFO L87 Difference]: Start difference. First operand 120 states and 160 transitions. Second operand has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 11:46:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:19,974 INFO L93 Difference]: Finished difference Result 176 states and 251 transitions. [2022-11-16 11:46:19,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:46:19,975 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 89 [2022-11-16 11:46:19,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:19,977 INFO L225 Difference]: With dead ends: 176 [2022-11-16 11:46:19,977 INFO L226 Difference]: Without dead ends: 174 [2022-11-16 11:46:19,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-11-16 11:46:19,978 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 48 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:19,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1388 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 11:46:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-16 11:46:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 155. [2022-11-16 11:46:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 97 states have (on average 1.175257731958763) internal successors, (114), 102 states have internal predecessors, (114), 44 states have call successors, (44), 10 states have call predecessors, (44), 13 states have return successors, (58), 42 states have call predecessors, (58), 43 states have call successors, (58) [2022-11-16 11:46:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 216 transitions. [2022-11-16 11:46:20,006 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 216 transitions. Word has length 89 [2022-11-16 11:46:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:20,008 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 216 transitions. [2022-11-16 11:46:20,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 11:46:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 216 transitions. [2022-11-16 11:46:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-16 11:46:20,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:20,011 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:20,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:46:20,012 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:20,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1974343619, now seen corresponding path program 1 times [2022-11-16 11:46:20,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:20,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708556645] [2022-11-16 11:46:20,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:20,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:46:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:46:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-16 11:46:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-16 11:46:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 11:46:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 11:46:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 11:46:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 11:46:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 11:46:21,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:21,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708556645] [2022-11-16 11:46:21,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708556645] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:21,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296013336] [2022-11-16 11:46:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:21,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:21,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:21,539 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:21,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:46:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:22,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-16 11:46:22,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:22,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 11:46:22,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:22,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:46:22,240 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-16 11:46:22,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 94 [2022-11-16 11:46:22,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2022-11-16 11:46:22,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-16 11:46:22,455 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_2|))) (let ((.cse0 (select .cse1 24))) (and (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_2|) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_2) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (= .cse0 (select v_DerPreprocessor_2 24)) (= (select .cse1 0) .cse0))))) is different from true [2022-11-16 11:46:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-16 11:46:23,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:46:23,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3573 (Array Int Int)) (v_ArrVal_3574 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_3573) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_3574) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|) |c_ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))) is different from false [2022-11-16 11:46:23,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:46:23,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-11-16 11:46:23,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:46:23,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 339 treesize of output 301 [2022-11-16 11:46:23,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 314 [2022-11-16 11:46:23,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 310 [2022-11-16 11:46:24,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-16 11:46:24,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-16 11:46:24,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:24,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:46:24,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 67 [2022-11-16 11:46:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 1 not checked. [2022-11-16 11:46:24,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296013336] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:46:24,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:46:24,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 30 [2022-11-16 11:46:24,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071810939] [2022-11-16 11:46:24,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:46:24,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 11:46:24,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:24,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 11:46:24,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=668, Unknown=7, NotChecked=106, Total=870 [2022-11-16 11:46:24,374 INFO L87 Difference]: Start difference. First operand 155 states and 216 transitions. Second operand has 30 states, 28 states have (on average 4.0) internal successors, (112), 30 states have internal predecessors, (112), 8 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 8 states have call successors, (21) [2022-11-16 11:46:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:25,577 INFO L93 Difference]: Finished difference Result 383 states and 538 transitions. [2022-11-16 11:46:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:46:25,578 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 4.0) internal successors, (112), 30 states have internal predecessors, (112), 8 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 8 states have call successors, (21) Word has length 91 [2022-11-16 11:46:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:25,580 INFO L225 Difference]: With dead ends: 383 [2022-11-16 11:46:25,580 INFO L226 Difference]: Without dead ends: 247 [2022-11-16 11:46:25,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=173, Invalid=1141, Unknown=26, NotChecked=142, Total=1482 [2022-11-16 11:46:25,583 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 161 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 2568 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 870 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:25,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 2568 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 568 Invalid, 0 Unknown, 870 Unchecked, 0.7s Time] [2022-11-16 11:46:25,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-16 11:46:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 193. [2022-11-16 11:46:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 135 states have internal predecessors, (152), 47 states have call successors, (47), 12 states have call predecessors, (47), 15 states have return successors, (62), 45 states have call predecessors, (62), 46 states have call successors, (62) [2022-11-16 11:46:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 261 transitions. [2022-11-16 11:46:25,614 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 261 transitions. Word has length 91 [2022-11-16 11:46:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:25,614 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 261 transitions. [2022-11-16 11:46:25,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 4.0) internal successors, (112), 30 states have internal predecessors, (112), 8 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (21), 6 states have call predecessors, (21), 8 states have call successors, (21) [2022-11-16 11:46:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 261 transitions. [2022-11-16 11:46:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-16 11:46:25,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:25,616 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:25,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:46:25,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:25,832 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -50095425, now seen corresponding path program 1 times [2022-11-16 11:46:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:25,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517394521] [2022-11-16 11:46:25,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:25,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:26,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:26,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:26,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:46:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:46:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:46:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:46:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:46:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:46:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:46:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:46:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-16 11:46:27,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:27,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517394521] [2022-11-16 11:46:27,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517394521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:27,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:27,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 11:46:27,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864094951] [2022-11-16 11:46:27,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:27,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:46:27,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:27,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:46:27,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:46:27,195 INFO L87 Difference]: Start difference. First operand 193 states and 261 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 11:46:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:46:27,737 INFO L93 Difference]: Finished difference Result 305 states and 421 transitions. [2022-11-16 11:46:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:46:27,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 89 [2022-11-16 11:46:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:46:27,739 INFO L225 Difference]: With dead ends: 305 [2022-11-16 11:46:27,739 INFO L226 Difference]: Without dead ends: 199 [2022-11-16 11:46:27,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:46:27,741 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 56 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:46:27,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 856 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:46:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-16 11:46:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2022-11-16 11:46:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.171641791044776) internal successors, (157), 140 states have internal predecessors, (157), 47 states have call successors, (47), 12 states have call predecessors, (47), 16 states have return successors, (67), 45 states have call predecessors, (67), 46 states have call successors, (67) [2022-11-16 11:46:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 271 transitions. [2022-11-16 11:46:27,769 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 271 transitions. Word has length 89 [2022-11-16 11:46:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:46:27,769 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 271 transitions. [2022-11-16 11:46:27,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-16 11:46:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 271 transitions. [2022-11-16 11:46:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-16 11:46:27,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:46:27,771 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:46:27,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:46:27,772 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:46:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:27,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1447052805, now seen corresponding path program 2 times [2022-11-16 11:46:27,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:27,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697132824] [2022-11-16 11:46:27,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:27,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:29,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:46:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:46:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:29,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:46:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:29,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:46:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:46:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:29,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 11:46:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-16 11:46:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:29,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 11:46:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:29,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 11:46:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:29,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 11:46:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 11:46:29,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:29,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697132824] [2022-11-16 11:46:29,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697132824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:46:29,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611464782] [2022-11-16 11:46:29,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:46:29,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:46:29,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:29,651 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:46:29,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:46:30,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:46:30,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:46:30,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-16 11:46:30,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:46:30,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:30,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:30,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 11:46:30,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:46:30,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-11-16 11:46:30,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-16 11:46:32,504 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_5| Int)) (<= (+ (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_5|) 24) 2) |v_ULTIMATE.start_aws_linked_list_push_back_~list#1.base_BEFORE_CALL_5|)) is different from true [2022-11-16 11:47:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-16 11:47:01,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:47:26,595 INFO L321 Elim1Store]: treesize reduction 23, result has 86.1 percent of original size [2022-11-16 11:47:26,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 1115 treesize of output 1178 [2022-11-16 11:47:26,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1631 treesize of output 1583 [2022-11-16 11:47:26,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1583 treesize of output 1535 [2022-11-16 11:47:26,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1535 treesize of output 1511 [2022-11-16 11:47:26,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:47:26,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1973 treesize of output 1959 [2022-11-16 11:47:27,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:47:27,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1861 treesize of output 1873 [2022-11-16 11:47:31,916 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 11:47:31,956 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 11:47:31,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2022-11-16 11:47:31,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:47:31,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2022-11-16 11:47:32,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:47:32,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:47:32,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 97 [2022-11-16 11:47:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-16 11:47:32,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611464782] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:47:32,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:47:32,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 18] total 42 [2022-11-16 11:47:32,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766864201] [2022-11-16 11:47:32,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:47:32,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-16 11:47:32,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-16 11:47:32,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1492, Unknown=13, NotChecked=78, Total=1722 [2022-11-16 11:47:32,528 INFO L87 Difference]: Start difference. First operand 198 states and 271 transitions. Second operand has 42 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 37 states have internal predecessors, (130), 10 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-16 11:48:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:23,188 INFO L93 Difference]: Finished difference Result 462 states and 652 transitions. [2022-11-16 11:48:23,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 11:48:23,191 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 37 states have internal predecessors, (130), 10 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) Word has length 93 [2022-11-16 11:48:23,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:23,194 INFO L225 Difference]: With dead ends: 462 [2022-11-16 11:48:23,194 INFO L226 Difference]: Without dead ends: 323 [2022-11-16 11:48:23,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 102.6s TimeCoverageRelationStatistics Valid=338, Invalid=3172, Unknown=34, NotChecked=116, Total=3660 [2022-11-16 11:48:23,200 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 254 mSDsluCounter, 2778 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 2942 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 631 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:23,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 2942 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1485 Invalid, 0 Unknown, 631 Unchecked, 2.6s Time] [2022-11-16 11:48:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-16 11:48:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 193. [2022-11-16 11:48:23,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 135 states have internal predecessors, (152), 46 states have call successors, (46), 12 states have call predecessors, (46), 16 states have return successors, (66), 45 states have call predecessors, (66), 45 states have call successors, (66) [2022-11-16 11:48:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2022-11-16 11:48:23,245 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 93 [2022-11-16 11:48:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:23,246 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2022-11-16 11:48:23,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 3.4210526315789473) internal successors, (130), 37 states have internal predecessors, (130), 10 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (23), 7 states have call predecessors, (23), 9 states have call successors, (23) [2022-11-16 11:48:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2022-11-16 11:48:23,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-16 11:48:23,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:23,248 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:23,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:48:23,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 11:48:23,458 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:48:23,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:23,459 INFO L85 PathProgramCache]: Analyzing trace with hash -443122435, now seen corresponding path program 1 times [2022-11-16 11:48:23,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:23,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555912656] [2022-11-16 11:48:23,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:23,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:23,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:48:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:23,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:48:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:23,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:48:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:48:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:23,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:48:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:23,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:48:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:23,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:48:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:23,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:48:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:23,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:48:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:23,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:48:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-16 11:48:24,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:24,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555912656] [2022-11-16 11:48:24,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555912656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:24,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:24,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:48:24,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724612392] [2022-11-16 11:48:24,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:24,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:48:24,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:24,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:48:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:48:24,064 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-16 11:48:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:24,333 INFO L93 Difference]: Finished difference Result 325 states and 452 transitions. [2022-11-16 11:48:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:48:24,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 89 [2022-11-16 11:48:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:24,336 INFO L225 Difference]: With dead ends: 325 [2022-11-16 11:48:24,336 INFO L226 Difference]: Without dead ends: 195 [2022-11-16 11:48:24,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:48:24,337 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 37 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:24,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 744 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:48:24,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-16 11:48:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2022-11-16 11:48:24,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 135 states have internal predecessors, (152), 45 states have call successors, (45), 12 states have call predecessors, (45), 16 states have return successors, (61), 44 states have call predecessors, (61), 44 states have call successors, (61) [2022-11-16 11:48:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 258 transitions. [2022-11-16 11:48:24,380 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 258 transitions. Word has length 89 [2022-11-16 11:48:24,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:24,381 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 258 transitions. [2022-11-16 11:48:24,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-16 11:48:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 258 transitions. [2022-11-16 11:48:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-16 11:48:24,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:24,383 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 11:48:24,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:48:24,384 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:48:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:24,384 INFO L85 PathProgramCache]: Analyzing trace with hash -754133866, now seen corresponding path program 1 times [2022-11-16 11:48:24,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:24,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106947048] [2022-11-16 11:48:24,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:24,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:48:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:48:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:48:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:48:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:48:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:48:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 11:48:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 11:48:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:48:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:48:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 11:48:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-16 11:48:24,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:24,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106947048] [2022-11-16 11:48:24,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106947048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:24,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264731455] [2022-11-16 11:48:24,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:24,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:24,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:48:24,967 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:48:24,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:48:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:25,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 11:48:25,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:48:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-16 11:48:25,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:48:25,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264731455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:25,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:48:25,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-11-16 11:48:25,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868124445] [2022-11-16 11:48:25,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:25,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:48:25,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:25,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:48:25,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:48:25,741 INFO L87 Difference]: Start difference. First operand 192 states and 258 transitions. Second operand has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 11:48:26,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:26,056 INFO L93 Difference]: Finished difference Result 348 states and 478 transitions. [2022-11-16 11:48:26,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:48:26,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 101 [2022-11-16 11:48:26,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:26,059 INFO L225 Difference]: With dead ends: 348 [2022-11-16 11:48:26,059 INFO L226 Difference]: Without dead ends: 190 [2022-11-16 11:48:26,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:48:26,060 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 127 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:26,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 605 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:48:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-16 11:48:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2022-11-16 11:48:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 127 states have (on average 1.141732283464567) internal successors, (145), 133 states have internal predecessors, (145), 45 states have call successors, (45), 12 states have call predecessors, (45), 16 states have return successors, (60), 43 states have call predecessors, (60), 44 states have call successors, (60) [2022-11-16 11:48:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 250 transitions. [2022-11-16 11:48:26,099 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 250 transitions. Word has length 101 [2022-11-16 11:48:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:26,100 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 250 transitions. [2022-11-16 11:48:26,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-16 11:48:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 250 transitions. [2022-11-16 11:48:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-16 11:48:26,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:26,102 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:26,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:48:26,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:26,312 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:48:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:26,313 INFO L85 PathProgramCache]: Analyzing trace with hash -270009515, now seen corresponding path program 1 times [2022-11-16 11:48:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:26,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586174508] [2022-11-16 11:48:26,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:48:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:48:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:48:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:48:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:48:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:48:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:48:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:48:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:48:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:48:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 11:48:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 11:48:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-16 11:48:35,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:35,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586174508] [2022-11-16 11:48:35,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586174508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:35,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:35,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-16 11:48:35,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370831735] [2022-11-16 11:48:35,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:35,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 11:48:35,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:35,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 11:48:35,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:48:35,980 INFO L87 Difference]: Start difference. First operand 189 states and 250 transitions. Second operand has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-16 11:48:37,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:37,455 INFO L93 Difference]: Finished difference Result 218 states and 297 transitions. [2022-11-16 11:48:37,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:48:37,456 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 103 [2022-11-16 11:48:37,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:37,458 INFO L225 Difference]: With dead ends: 218 [2022-11-16 11:48:37,458 INFO L226 Difference]: Without dead ends: 216 [2022-11-16 11:48:37,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2022-11-16 11:48:37,459 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 65 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:37,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1403 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 11:48:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-16 11:48:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2022-11-16 11:48:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 132 states have (on average 1.1363636363636365) internal successors, (150), 139 states have internal predecessors, (150), 46 states have call successors, (46), 13 states have call predecessors, (46), 18 states have return successors, (64), 44 states have call predecessors, (64), 45 states have call successors, (64) [2022-11-16 11:48:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 260 transitions. [2022-11-16 11:48:37,492 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 260 transitions. Word has length 103 [2022-11-16 11:48:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:37,493 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 260 transitions. [2022-11-16 11:48:37,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 14 states have internal predecessors, (58), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-16 11:48:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-11-16 11:48:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-16 11:48:37,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:37,495 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:37,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:48:37,495 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:48:37,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1079356141, now seen corresponding path program 1 times [2022-11-16 11:48:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:37,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104194395] [2022-11-16 11:48:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:37,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:48:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:48:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:48:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:48:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:48:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:48:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:48:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:48:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:48:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:48:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 11:48:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 11:48:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-16 11:48:40,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:40,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104194395] [2022-11-16 11:48:40,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104194395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:40,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:40,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 11:48:40,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346197974] [2022-11-16 11:48:40,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:40,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:48:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:40,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:48:40,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:48:40,805 INFO L87 Difference]: Start difference. First operand 197 states and 260 transitions. Second operand has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-16 11:48:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:41,999 INFO L93 Difference]: Finished difference Result 334 states and 448 transitions. [2022-11-16 11:48:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:48:42,000 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 103 [2022-11-16 11:48:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:42,002 INFO L225 Difference]: With dead ends: 334 [2022-11-16 11:48:42,002 INFO L226 Difference]: Without dead ends: 215 [2022-11-16 11:48:42,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:48:42,004 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 58 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:42,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1143 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 11:48:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-16 11:48:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2022-11-16 11:48:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 132 states have (on average 1.1363636363636365) internal successors, (150), 139 states have internal predecessors, (150), 46 states have call successors, (46), 13 states have call predecessors, (46), 18 states have return successors, (62), 44 states have call predecessors, (62), 45 states have call successors, (62) [2022-11-16 11:48:42,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 258 transitions. [2022-11-16 11:48:42,038 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 258 transitions. Word has length 103 [2022-11-16 11:48:42,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:42,038 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 258 transitions. [2022-11-16 11:48:42,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 7 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-16 11:48:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 258 transitions. [2022-11-16 11:48:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-16 11:48:42,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:42,040 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:42,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:48:42,041 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:48:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:42,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1472383151, now seen corresponding path program 1 times [2022-11-16 11:48:42,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:42,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841308711] [2022-11-16 11:48:42,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:42,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:48:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:48:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:48:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:48:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:48:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:48:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:48:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:48:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:48:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:48:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 11:48:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 11:48:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-16 11:48:42,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:42,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841308711] [2022-11-16 11:48:42,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841308711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:48:42,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:48:42,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:48:42,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725158856] [2022-11-16 11:48:42,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:48:42,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:48:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:48:42,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:48:42,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:48:42,487 INFO L87 Difference]: Start difference. First operand 197 states and 258 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-16 11:48:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:48:42,708 INFO L93 Difference]: Finished difference Result 308 states and 402 transitions. [2022-11-16 11:48:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:48:42,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2022-11-16 11:48:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:48:42,711 INFO L225 Difference]: With dead ends: 308 [2022-11-16 11:48:42,711 INFO L226 Difference]: Without dead ends: 188 [2022-11-16 11:48:42,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:48:42,717 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 37 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:48:42,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 615 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:48:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-11-16 11:48:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-11-16 11:48:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 126 states have (on average 1.126984126984127) internal successors, (142), 131 states have internal predecessors, (142), 45 states have call successors, (45), 13 states have call predecessors, (45), 16 states have return successors, (55), 43 states have call predecessors, (55), 44 states have call successors, (55) [2022-11-16 11:48:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 242 transitions. [2022-11-16 11:48:42,758 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 242 transitions. Word has length 103 [2022-11-16 11:48:42,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:48:42,758 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 242 transitions. [2022-11-16 11:48:42,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-16 11:48:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2022-11-16 11:48:42,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-16 11:48:42,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:48:42,760 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:48:42,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:48:42,760 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:48:42,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:48:42,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2046460642, now seen corresponding path program 3 times [2022-11-16 11:48:42,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:48:42,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691174826] [2022-11-16 11:48:42,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:48:42,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:48:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:48:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:48:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:48:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:48:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:48:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:48:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 11:48:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-16 11:48:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 11:48:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 11:48:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:48:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:48:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-16 11:48:49,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:48:49,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691174826] [2022-11-16 11:48:49,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691174826] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:48:49,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763619030] [2022-11-16 11:48:49,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:48:49,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:48:49,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:48:49,298 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:48:49,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:48:50,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-16 11:48:50,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:48:50,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 171 conjunts are in the unsatisfiable core [2022-11-16 11:48:50,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:48:50,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-16 11:48:50,934 INFO L321 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-11-16 11:48:50,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-11-16 11:48:50,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-16 11:48:50,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-16 11:48:50,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 25 [2022-11-16 11:48:50,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:48:51,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:51,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 267 [2022-11-16 11:48:51,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:51,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:51,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:51,393 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-16 11:48:51,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 85 [2022-11-16 11:48:51,459 INFO L321 Elim1Store]: treesize reduction 63, result has 27.6 percent of original size [2022-11-16 11:48:51,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 156 treesize of output 191 [2022-11-16 11:48:51,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:48:51,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 124 [2022-11-16 11:48:51,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 27 [2022-11-16 11:48:51,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:51,543 INFO L321 Elim1Store]: treesize reduction 27, result has 58.5 percent of original size [2022-11-16 11:48:51,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 97 [2022-11-16 11:48:51,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:51,587 INFO L321 Elim1Store]: treesize reduction 35, result has 57.8 percent of original size [2022-11-16 11:48:51,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 109 [2022-11-16 11:48:51,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-16 11:48:51,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 31 [2022-11-16 11:48:51,695 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-16 11:48:51,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 136 [2022-11-16 11:48:51,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2022-11-16 11:48:51,874 INFO L321 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2022-11-16 11:48:51,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 183 [2022-11-16 11:48:52,038 INFO L321 Elim1Store]: treesize reduction 84, result has 19.2 percent of original size [2022-11-16 11:48:52,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 316 treesize of output 257 [2022-11-16 11:48:52,175 INFO L321 Elim1Store]: treesize reduction 84, result has 11.6 percent of original size [2022-11-16 11:48:52,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 717 treesize of output 504 [2022-11-16 11:48:52,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:48:53,487 INFO L321 Elim1Store]: treesize reduction 8, result has 77.8 percent of original size [2022-11-16 11:48:53,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 213 treesize of output 134 [2022-11-16 11:48:53,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:53,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:48:53,619 INFO L321 Elim1Store]: treesize reduction 143, result has 27.4 percent of original size [2022-11-16 11:48:53,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 7 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 24 case distinctions, treesize of input 83 treesize of output 97 [2022-11-16 11:48:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-16 11:48:53,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:48:55,239 INFO L321 Elim1Store]: treesize reduction 173, result has 36.2 percent of original size [2022-11-16 11:48:55,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 4526 treesize of output 2856 [2022-11-16 11:48:55,820 INFO L321 Elim1Store]: treesize reduction 34, result has 67.0 percent of original size [2022-11-16 11:48:55,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28361 treesize of output 26070 [2022-11-16 11:48:57,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23768 treesize of output 23700 [2022-11-16 11:58:53,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-16 11:58:54,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-16 11:58:54,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-16 11:58:54,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-16 11:58:54,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-16 11:58:54,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-16 11:58:54,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-16 11:59:03,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:03,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:03,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:03,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:03,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:59:03,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-16 11:59:03,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:59:03,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-16 11:59:03,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:03,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:04,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:04,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:04,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:04,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:04,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:04,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-16 11:59:05,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:05,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:06,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:06,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:06,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:06,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:06,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:06,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:06,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:06,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:06,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 342 treesize of output 338 [2022-11-16 11:59:06,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:07,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:07,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:07,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:07,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:07,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:07,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:07,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-16 11:59:10,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-16 11:59:10,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 267 [2022-11-16 11:59:10,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 312 [2022-11-16 11:59:11,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:11,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 271 [2022-11-16 11:59:11,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 193 [2022-11-16 11:59:11,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 113 [2022-11-16 11:59:11,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:11,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:11,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 147 [2022-11-16 11:59:11,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 188 [2022-11-16 11:59:11,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 189 [2022-11-16 11:59:11,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 111 [2022-11-16 11:59:11,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-16 11:59:11,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-16 11:59:11,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:11,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:11,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-16 11:59:11,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-16 11:59:11,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-16 11:59:11,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-11-16 11:59:11,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-16 11:59:11,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-11-16 11:59:11,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:11,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:11,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:11,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:11,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 226 [2022-11-16 11:59:11,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 239 [2022-11-16 11:59:11,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 232 [2022-11-16 11:59:11,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 289 [2022-11-16 11:59:11,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 620 treesize of output 612 [2022-11-16 11:59:12,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 405 treesize of output 403 [2022-11-16 11:59:12,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 349 treesize of output 325 [2022-11-16 11:59:12,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 646 treesize of output 630 [2022-11-16 11:59:12,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 681 treesize of output 675 [2022-11-16 11:59:12,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:12,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:12,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:12,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:12,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:12,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-16 11:59:12,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-11-16 11:59:12,350 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-16 11:59:12,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:12,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:12,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:12,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 226 [2022-11-16 11:59:12,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 239 [2022-11-16 11:59:12,494 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:12,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1802 treesize of output 1 [2022-11-16 11:59:12,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 550 treesize of output 534 [2022-11-16 11:59:12,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 581 treesize of output 575 [2022-11-16 11:59:12,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:12,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:12,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:12,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 365 [2022-11-16 11:59:12,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 287 [2022-11-16 11:59:12,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:12,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:12,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:12,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:13,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:13,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:13,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-16 11:59:13,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:13,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 202 [2022-11-16 11:59:13,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:13,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:13,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:13,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:13,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 175 [2022-11-16 11:59:13,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:13,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 367 treesize of output 351 [2022-11-16 11:59:14,211 INFO L321 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-16 11:59:14,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1802 treesize of output 1648 [2022-11-16 11:59:15,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:15,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 219 [2022-11-16 11:59:15,814 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:15,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-11-16 11:59:15,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:15,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2022-11-16 11:59:15,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:15,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2022-11-16 11:59:15,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:15,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:15,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:15,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:15,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:15,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 329 treesize of output 299 [2022-11-16 11:59:16,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:16,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:16,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:16,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:16,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:16,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-11-16 11:59:16,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:16,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:16,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-11-16 11:59:16,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:16,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:16,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 177 [2022-11-16 11:59:17,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:17,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:17,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:17,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:17,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:17,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:17,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:17,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:17,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:17,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:17,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:17,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-11-16 11:59:17,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:17,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:17,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 177 [2022-11-16 11:59:17,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:17,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:17,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:17,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 257 [2022-11-16 11:59:17,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:17,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2022-11-16 11:59:17,987 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:17,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2022-11-16 11:59:18,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:18,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:18,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:18,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 281 treesize of output 257 [2022-11-16 11:59:18,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:18,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:18,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 233 [2022-11-16 11:59:18,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:18,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:18,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 71 [2022-11-16 11:59:18,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 144 [2022-11-16 11:59:19,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:19,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:19,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:19,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:19,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 617 treesize of output 589 [2022-11-16 11:59:20,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:20,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:20,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:20,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-11-16 11:59:20,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:20,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:20,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 71 [2022-11-16 11:59:20,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:20,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:20,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 471 treesize of output 453 [2022-11-16 11:59:21,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:21,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:21,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:21,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:21,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:21,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:21,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:21,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 620 treesize of output 612 [2022-11-16 11:59:22,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:22,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-11-16 11:59:22,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:22,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:22,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:22,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:22,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:22,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 350 treesize of output 322 [2022-11-16 11:59:23,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:23,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 713 treesize of output 685 [2022-11-16 11:59:24,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:24,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:24,494 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:24,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 548 treesize of output 530 [2022-11-16 11:59:25,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:25,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:25,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:25,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 71 [2022-11-16 11:59:25,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:25,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-11-16 11:59:25,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:25,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 389 [2022-11-16 11:59:25,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:25,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 281 treesize of output 257 [2022-11-16 11:59:26,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:26,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:26,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:26,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:26,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:26,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:26,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:26,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:26,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:26,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:26,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:26,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:26,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:26,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:26,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:26,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:59:26,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-11-16 11:59:26,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:59:26,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-11-16 11:59:26,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:26,864 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:26,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2022-11-16 11:59:26,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:26,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2022-11-16 11:59:26,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:26,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2022-11-16 11:59:27,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:27,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2022-11-16 11:59:27,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:27,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2022-11-16 11:59:27,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:27,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 11:59:27,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:27,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:27,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 71 [2022-11-16 11:59:27,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:59:27,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 154 [2022-11-16 11:59:27,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-16 11:59:29,940 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 8 c_aws_linked_list_insert_before_~before.offset))) (let ((.cse51 (forall ((v_ArrVal_6059 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6059) c_aws_linked_list_insert_before_~before.base) .cse4)))) (.cse16 (forall ((v_ArrVal_6057 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6057) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse15 (forall ((v_ArrVal_6072 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6072) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))))) (let ((.cse75 (= c_aws_linked_list_insert_before_~to_add.base c_aws_linked_list_insert_before_~before.base)) (.cse3 (= c_aws_linked_list_insert_before_~before.offset c_aws_linked_list_insert_before_~to_add.offset)) (.cse17 (forall ((v_ArrVal_6100 (Array Int Int)) (v_ArrVal_6059 (Array Int Int))) (let ((.cse190 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6059) c_aws_linked_list_insert_before_~before.base) .cse4)) (.cse191 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6100) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= c_aws_linked_list_insert_before_~to_add.base .cse190) (= .cse191 .cse190) (= .cse191 c_aws_linked_list_insert_before_~to_add.base))))) (.cse70 (or .cse16 .cse15)) (.cse58 (or .cse16 .cse51 .cse15)) (.cse113 (forall ((v_ArrVal_6057 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6057) c_aws_linked_list_insert_before_~before.base) .cse4)))) (.cse25 (forall ((v_ArrVal_6100 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6100) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))))) (let ((.cse50 (= .cse4 c_aws_linked_list_insert_before_~to_add.offset)) (.cse168 (or .cse113 .cse25 .cse51 .cse15)) (.cse78 (and .cse70 .cse58)) (.cse6 (or .cse113 .cse17 .cse15)) (.cse14 (forall ((v_ArrVal_6100 (Array Int Int)) (v_ArrVal_6059 (Array Int Int))) (let ((.cse189 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6100) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse189 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6059) c_aws_linked_list_insert_before_~before.base) .cse4)) (= .cse189 c_aws_linked_list_insert_before_~to_add.base))))) (.cse54 (or .cse16 .cse3 .cse15)) (.cse12 (not .cse75)) (.cse1 (forall ((v_ArrVal_6100 (Array Int Int)) (v_ArrVal_6059 (Array Int Int))) (let ((.cse188 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6100) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse188 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6059) c_aws_linked_list_insert_before_~before.base) .cse4)) (not (= .cse188 c_aws_linked_list_insert_before_~to_add.base))))))) (let ((.cse60 (or .cse16 .cse1 .cse15)) (.cse2 (or .cse25 .cse51 .cse15)) (.cse121 (or .cse1 .cse15)) (.cse101 (or .cse12 .cse3 .cse15)) (.cse79 (and .cse70 .cse54)) (.cse72 (or .cse12 .cse15)) (.cse7 (or .cse17 .cse15)) (.cse8 (or .cse113 .cse14 .cse15)) (.cse11 (or .cse14 .cse15)) (.cse9 (or .cse16 .cse14 .cse15)) (.cse10 (or .cse16 .cse17 .cse15)) (.cse123 (or .cse12 (and (or (forall ((v_prenex_6169 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6169) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6166 (Array Int Int)) (v_prenex_6168 (Array Int Int))) (let ((.cse179 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6166) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse179 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6168) c_aws_linked_list_insert_before_~before.base) .cse4)) (= .cse179 c_aws_linked_list_insert_before_~to_add.base)))) (forall ((v_prenex_6167 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6167) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or (forall ((v_prenex_6173 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6173) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6172 (Array Int Int)) (v_prenex_6170 (Array Int Int))) (let ((.cse180 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6172) c_aws_linked_list_insert_before_~before.base) .cse4)) (.cse181 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6170) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= c_aws_linked_list_insert_before_~to_add.base .cse180) (= .cse180 .cse181) (= c_aws_linked_list_insert_before_~to_add.base .cse181))))) .cse6 (or (forall ((v_prenex_6158 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6158) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6171 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6171) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)) (forall ((v_prenex_6157 (Array Int Int)) (v_prenex_6156 (Array Int Int))) (let ((.cse183 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6156) c_aws_linked_list_insert_before_~before.base) .cse4)) (.cse182 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6157) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= c_aws_linked_list_insert_before_~to_add.base .cse182) (= .cse183 c_aws_linked_list_insert_before_~to_add.base) (= .cse183 .cse182))))) (or (forall ((v_prenex_6153 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6153) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_6154 (Array Int Int)) (v_prenex_6152 (Array Int Int))) (let ((.cse184 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6152) c_aws_linked_list_insert_before_~before.base) .cse4)) (.cse185 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6154) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse184 .cse185) (= .cse184 c_aws_linked_list_insert_before_~to_add.base) (= c_aws_linked_list_insert_before_~to_add.base .cse185)))) (forall ((v_prenex_6155 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6155) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or (forall ((v_prenex_6165 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6165) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6164 (Array Int Int)) (v_prenex_6162 (Array Int Int))) (let ((.cse186 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6162) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse186 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6164) c_aws_linked_list_insert_before_~before.base) .cse4)) (= c_aws_linked_list_insert_before_~to_add.base .cse186)))) (forall ((v_prenex_6163 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6163) c_aws_linked_list_insert_before_~before.base) .cse4)))) (or (forall ((v_prenex_6161 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6161) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6159 (Array Int Int)) (v_prenex_6160 (Array Int Int))) (let ((.cse187 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6159) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse187 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6160) c_aws_linked_list_insert_before_~before.base) .cse4)) (= c_aws_linked_list_insert_before_~to_add.base .cse187)))))))) (.cse124 (or (forall ((v_prenex_6175 (Array Int Int)) (v_prenex_6180 (Array Int Int))) (let ((.cse178 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6175) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= c_aws_linked_list_insert_before_~to_add.base .cse178) (= .cse178 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6180) c_aws_linked_list_insert_before_~before.base) .cse4))))) (forall ((v_prenex_6179 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6179) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6181 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6181) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))))) (.cse125 (or (forall ((v_prenex_6177 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6177) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6176 (Array Int Int)) (v_prenex_6178 (Array Int Int))) (let ((.cse177 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6178) c_aws_linked_list_insert_before_~before.base) .cse4)) (.cse176 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6176) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= c_aws_linked_list_insert_before_~to_add.base .cse176) (= c_aws_linked_list_insert_before_~to_add.base .cse177) (= .cse177 .cse176)))) (forall ((v_prenex_6174 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6174) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse160 (or .cse3 .cse78)) (.cse110 (or (and (or (forall ((v_prenex_6059 (Array Int Int)) (v_prenex_6060 (Array Int Int))) (let ((.cse173 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6059) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse173 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6060) c_aws_linked_list_insert_before_~before.base) .cse4)) (not (= c_aws_linked_list_insert_before_~to_add.base .cse173))))) (forall ((v_prenex_6061 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6061) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (or (forall ((v_prenex_6069 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6069) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_6072 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6072) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6070 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6070) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6071 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6071) c_aws_linked_list_insert_before_~before.base) .cse4)))) (or (forall ((v_prenex_6074 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6074) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6075 (Array Int Int)) (v_prenex_6073 (Array Int Int))) (let ((.cse174 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6073) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse174 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6075) c_aws_linked_list_insert_before_~before.base) .cse4)) (not (= c_aws_linked_list_insert_before_~to_add.base .cse174))))) (forall ((v_prenex_6076 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6076) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or (forall ((v_prenex_6078 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6078) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6077 (Array Int Int)) (v_prenex_6079 (Array Int Int))) (let ((.cse175 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6077) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse175 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6079) c_aws_linked_list_insert_before_~before.base) .cse4)) (not (= c_aws_linked_list_insert_before_~to_add.base .cse175))))) (forall ((v_prenex_6080 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6080) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or (forall ((v_prenex_6062 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6062) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_6064 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6064) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6063 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6063) c_aws_linked_list_insert_before_~before.base) .cse4)))) (or (forall ((v_prenex_6068 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6068) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6065 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6065) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6066 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6066) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_6067 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6067) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) .cse168) .cse12)) (.cse111 (or (forall ((v_prenex_6086 (Array Int Int)) (v_prenex_6081 (Array Int Int))) (let ((.cse172 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6081) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse172 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6086) c_aws_linked_list_insert_before_~before.base) .cse4)) (not (= c_aws_linked_list_insert_before_~to_add.base .cse172))))) (forall ((v_prenex_6088 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6088) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6085 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6085) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse112 (or (forall ((v_prenex_6084 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6084) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6083 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6083) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_6087 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6087) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6082 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6082) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)))) (.cse13 (not .cse50)) (.cse44 (or .cse3 .cse15))) (let ((.cse42 (forall ((v_prenex_5963 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5963) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (.cse43 (forall ((v_prenex_5962 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5962) c_aws_linked_list_insert_before_~before.base) .cse4)))) (.cse27 (or .cse12 .cse17 .cse15)) (.cse39 (forall ((v_prenex_5993 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5993) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse40 (forall ((v_prenex_5992 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5992) c_aws_linked_list_insert_before_~before.base) .cse4)))) (.cse41 (forall ((v_prenex_5994 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5994) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (.cse38 (forall ((v_prenex_5995 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5995) c_aws_linked_list_insert_before_~before.base) .cse4)))) (.cse37 (forall ((v_prenex_5997 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5997) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse35 (forall ((v_prenex_5961 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5961) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse36 (forall ((v_prenex_5996 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5996) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse46 (forall ((v_prenex_5967 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5967) c_aws_linked_list_insert_before_~before.base) .cse4)))) (.cse47 (or (forall ((v_prenex_5933 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5933) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)) (forall ((v_prenex_5934 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5934) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))))) (.cse48 (or (forall ((v_prenex_5939 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5939) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_5942 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5942) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5940 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5940) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse0 (and .cse44 .cse54)) (.cse67 (or .cse16 .cse25 .cse15)) (.cse68 (or .cse12 .cse13 .cse25)) (.cse64 (or .cse12 .cse25 .cse15)) (.cse65 (or .cse25 .cse15)) (.cse49 (and (or .cse12 (forall ((v_prenex_5955 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5955) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_5954 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5954) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (or .cse12 (forall ((v_prenex_5982 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5982) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)) (forall ((v_prenex_5983 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5983) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_5984 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5984) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))))) (.cse69 (or .cse12 .cse13)) (.cse71 (or .cse16 .cse12 .cse15)) (.cse22 (and .cse110 .cse111 .cse112)) (.cse30 (forall ((v_prenex_5978 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5978) c_aws_linked_list_insert_before_~before.base) .cse4)))) (.cse33 (and (or (forall ((v_prenex_5945 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5945) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_5946 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5946) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_5947 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5947) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (or (forall ((v_prenex_5948 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5948) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_5944 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5944) c_aws_linked_list_insert_before_~before.base) .cse4))))))) (.cse31 (or (forall ((v_prenex_5943 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5943) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_5981 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5981) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)) (forall ((v_prenex_5980 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5980) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse32 (or (forall ((v_prenex_5975 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5975) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_5976 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5976) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)))) (.cse34 (forall ((v_prenex_5972 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5972) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (.cse45 (and (or (forall ((v_prenex_5929 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5929) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5930 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5930) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (or .cse16 .cse51 (forall ((v_prenex_5931 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5931) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))))) (.cse106 (or .cse113 .cse15)) (.cse63 (and .cse16 .cse75)) (.cse26 (and .cse160 .cse44)) (.cse66 (or .cse25 .cse75)) (.cse100 (and .cse123 .cse124 .cse125)) (.cse84 (or .cse113 .cse3 .cse15)) (.cse76 (or (forall ((v_prenex_3565 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_3565) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_3566 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_3566) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))))) (.cse77 (or (forall ((v_prenex_3568 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_3568) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_3567 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_3567) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse23 (forall ((v_ArrVal_6100 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6100) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (.cse28 (or (and .cse9 .cse10) .cse3)) (.cse29 (or .cse3 (and .cse6 .cse7 .cse8 .cse11))) (.cse59 (and .cse70 .cse72)) (.cse18 (and (or .cse12 .cse79) .cse70 .cse54)) (.cse24 (and .cse101 .cse54)) (.cse61 (or .cse3 (and .cse2 (or .cse113 .cse1 .cse15) .cse121 .cse168))) (.cse62 (or .cse3 (and .cse60 (or .cse16 .cse25 .cse51 .cse15))))) (and (or .cse0 .cse1) .cse2 (or .cse3 (and (or (forall ((v_prenex_5927 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5927) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_5923 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5923) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5926 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5926) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_5922 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5922) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or (forall ((v_prenex_5921 (Array Int Int)) (v_prenex_5925 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5921) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (not (= c_aws_linked_list_insert_before_~to_add.base .cse5)) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5925) c_aws_linked_list_insert_before_~before.base) .cse4) .cse5)))) (forall ((v_prenex_5924 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5924) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5928 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5928) c_aws_linked_list_insert_before_~before.base) .cse4))))))) (or .cse3 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)) (or (and (or .cse12 .cse13 .cse14) .cse9 (or .cse12 .cse14 .cse15) (or .cse16 .cse12 .cse14 .cse15)) .cse3) (or .cse17 .cse18) (or (and (or (forall ((v_prenex_6211 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6211) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6212 (Array Int Int)) (v_prenex_6215 (Array Int Int))) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6212) c_aws_linked_list_insert_before_~before.base) .cse4)) (.cse19 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6215) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse19 .cse20) (= c_aws_linked_list_insert_before_~to_add.base .cse20) (= .cse19 c_aws_linked_list_insert_before_~to_add.base)))) (forall ((v_prenex_6214 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6214) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or (forall ((v_prenex_6209 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6209) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6213 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6213) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6210 (Array Int Int)) (v_prenex_6208 (Array Int Int))) (let ((.cse21 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6208) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= c_aws_linked_list_insert_before_~to_add.base .cse21) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6210) c_aws_linked_list_insert_before_~before.base) .cse4) .cse21)))))) .cse3) (or .cse13 .cse22) (or .cse23 .cse24) (or .cse12 .cse25 .cse26) (or .cse3 (and (or .cse12 .cse13 .cse17) .cse27 .cse10 (or .cse16 .cse12 .cse17 .cse15))) (or .cse12 (and .cse28 .cse29)) (or (and (or .cse30 .cse12 (and (or (and (or (forall ((v_prenex_5949 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5949) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_5953 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5953) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or (forall ((v_prenex_5952 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5952) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_5950 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5950) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_5951 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5951) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)))) .cse3) (or (and .cse31 .cse32 (forall ((v_prenex_5970 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5970) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (or (forall ((v_prenex_5973 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5973) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_5979 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5979) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_5974 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5974) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or (forall ((v_prenex_5977 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5977) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_5971 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5971) c_aws_linked_list_insert_before_~before.base) .cse4)))))) .cse3) (or .cse3 .cse33) (or .cse3 .cse34))) (or (and (or .cse3 .cse35 .cse36) (or .cse12 .cse3 .cse37)) .cse38) (or .cse39 .cse40 .cse3 .cse41) (or .cse42 .cse12 .cse3 .cse43) (or .cse23 .cse12 (and .cse44 (or .cse3 .cse45))) (or .cse46 .cse3 (and (or .cse12 (and (forall ((v_prenex_5932 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5932) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) .cse47 (or (forall ((v_prenex_5936 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5936) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)) (forall ((v_prenex_5937 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5937) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5935 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5935) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)))) .cse48 (or (forall ((v_prenex_5938 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5938) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5941 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5941) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))))) (or (forall ((v_prenex_5968 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5968) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_5964 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5964) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_5969 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5969) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (or (forall ((v_prenex_5966 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5966) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_5965 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5965) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))))) (or .cse3 (forall ((v_prenex_5986 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5986) c_aws_linked_list_insert_before_~before.base) .cse4))) (and (or (forall ((v_prenex_5957 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5957) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)) (forall ((v_prenex_5958 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5958) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5956 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5956) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or .cse12 (and (or (forall ((v_prenex_5988 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5988) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_5989 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5989) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5987 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5987) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or (forall ((v_prenex_5985 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5985) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5990 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5990) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))))) (or (forall ((v_prenex_5959 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5959) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5960 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5960) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))))) (or .cse3 .cse49)) .cse50) (or .cse42 .cse12 .cse13 .cse43) .cse27 (or .cse25 .cse51 (let ((.cse52 (or (and (or (forall ((v_prenex_6043 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6043) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6042 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6042) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (or (forall ((v_prenex_6040 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6040) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) .cse3 (forall ((v_prenex_6039 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6039) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or (forall ((v_prenex_6045 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6045) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6046 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6046) c_aws_linked_list_insert_before_~before.base) .cse4))))) (forall ((v_prenex_6041 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6041) c_aws_linked_list_insert_before_~before.base) .cse4)))) (or .cse3 (forall ((v_prenex_6047 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6047) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6044 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6044) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)))) .cse12)) (.cse53 (or (forall ((v_prenex_6037 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6037) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6038 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6038) c_aws_linked_list_insert_before_~before.base) .cse4))))))) (and .cse52 .cse53 .cse54 (or .cse50 (and .cse52 .cse53 .cse54))))) (or .cse25 (let ((.cse56 (or (forall ((v_prenex_6139 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6139) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6140 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6140) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse57 (or .cse12 (and (or (forall ((v_prenex_6143 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6143) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6142 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6142) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6141 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6141) c_aws_linked_list_insert_before_~before.base) .cse4)))) (or (forall ((v_prenex_6144 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6144) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6145 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6145) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)) (forall ((v_prenex_6146 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6146) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or (forall ((v_prenex_6149 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6149) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6151 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6151) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (or (forall ((v_prenex_6148 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6148) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6150 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6150) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6147 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6147) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))))))) (let ((.cse55 (and .cse56 .cse57 .cse58))) (and (or .cse55 .cse13) (or .cse3 (and .cse56 (or .cse55 .cse50) .cse57 .cse58)))))) (or (and (or .cse23 .cse16 .cse12 .cse15) (or .cse23 .cse12 .cse15) (or .cse23 .cse12 .cse13) (or .cse23 .cse16 .cse15)) .cse3 .cse51) (or .cse59 .cse25 .cse3 .cse51) (or .cse39 .cse13 .cse40 .cse41) (or .cse12 .cse0 .cse25 .cse51) (or .cse38 (and (or .cse12 .cse13 .cse37) (or .cse13 .cse35 .cse36))) (or .cse25 .cse51 .cse24) (or .cse46 .cse12 .cse13 (and .cse47 .cse48)) (or .cse12 (and .cse60 (or (forall ((v_prenex_5917 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5917) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_5920 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5920) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_5918 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5918) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5919 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5919) c_aws_linked_list_insert_before_~before.base) .cse4))))) .cse3) (or .cse0 .cse14) (or (and .cse61 .cse62) .cse12) (or .cse23 .cse12 .cse51 .cse15) (forall ((v_ArrVal_6077 (Array Int Int)) (v_ArrVal_6058 (Array Int Int)) (v_ArrVal_6070 (Array Int Int)) (v_ArrVal_6094 (Array Int Int)) (v_ArrVal_6096 (Array Int Int)) (v_ArrVal_6053 (Array Int Int))) (= c_aws_linked_list_insert_before_~before.base (select (select (store (store (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base (store (store (select |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base) c_aws_linked_list_insert_before_~to_add.offset c_aws_linked_list_insert_before_~before.base) (+ 8 c_aws_linked_list_insert_before_~to_add.offset) (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6053) c_aws_linked_list_insert_before_~before.base) .cse4))) (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6058) c_aws_linked_list_insert_before_~before.base) .cse4) v_ArrVal_6094) c_aws_linked_list_insert_before_~before.base (store (select (store (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6096) (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_ArrVal_6077) c_aws_linked_list_insert_before_~before.base) .cse4) v_ArrVal_6070) c_aws_linked_list_insert_before_~before.base) .cse4 c_aws_linked_list_insert_before_~to_add.base)) c_aws_linked_list_insert_before_~to_add.base) c_aws_linked_list_insert_before_~to_add.offset))) (or .cse3 (and (or .cse63 (and .cse64 .cse65 .cse66)) .cse67 .cse68 .cse64)) .cse7 (or .cse23 .cse59 .cse3 .cse51) (or .cse23 (and .cse69 .cse70 .cse71 .cse72) .cse3 .cse51) (or .cse25 (and (or .cse12 .cse3 (and (or (forall ((v_prenex_6031 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6031) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6030 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6030) c_aws_linked_list_insert_before_~before.base) .cse4))))) .cse58)) (or .cse3 (and (or (forall ((v_prenex_6035 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6035) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6032 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6032) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6034 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6034) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (or (forall ((v_prenex_6033 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6033) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6036 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6036) c_aws_linked_list_insert_before_~before.base) .cse4))))))))) (or .cse25 .cse51 (let ((.cse74 (or (and (or (forall ((v_prenex_5912 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5912) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5911 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5911) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5914 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5914) c_aws_linked_list_insert_before_~before.base) .cse4)))) (or (forall ((v_prenex_5910 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5910) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5913 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5913) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))))) .cse12))) (let ((.cse73 (and .cse70 .cse74))) (and (or .cse3 (and (or .cse50 .cse73) .cse70 .cse74)) (or .cse13 .cse73))))) (or .cse25 .cse3 .cse51 .cse15) (or (and (or (forall ((v_prenex_5915 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5915) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) .cse3 (forall ((v_prenex_5916 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5916) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or .cse16 .cse12 .cse3 .cse15)) .cse25 .cse51) (or .cse75 (and (or .cse23 .cse16 .cse3 .cse51 .cse15) (or .cse23 (and (or .cse3 (forall ((v_prenex_5745 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5745) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_5744 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5744) c_aws_linked_list_insert_before_~before.base) .cse4))))) .cse76 (or .cse3 (and (or (forall ((v_prenex_5725 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5725) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5722 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5722) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) .cse77)) (or .cse13 (and (or (forall ((v_prenex_5738 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5738) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_5734 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5734) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (or (forall ((v_prenex_5741 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5741) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5735 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5735) c_aws_linked_list_insert_before_~before.base) .cse4)))))))) .cse51) .cse25 (or (forall ((v_prenex_5897 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5897) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5893 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5893) c_aws_linked_list_insert_before_~before.base) .cse4)))) .cse3 (forall ((v_prenex_5896 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5896) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_5894 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5894) c_aws_linked_list_insert_before_~before.base) .cse4)))) (or .cse23 .cse3 (and (or (forall ((v_prenex_5686 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5686) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5687 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5687) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) .cse58)) (or (forall ((v_prenex_5898 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5898) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_5899 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5899) c_aws_linked_list_insert_before_~before.base) .cse4)))) .cse3 (forall ((v_prenex_5900 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5900) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_5901 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5901) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or .cse23 (and (or (forall ((v_prenex_5715 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5715) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5714 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5714) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or .cse3 (forall ((v_prenex_5716 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5716) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_5717 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5717) c_aws_linked_list_insert_before_~before.base) .cse4)))))) .cse51) (or (and .cse67 .cse65) .cse3 .cse51) (or .cse23 .cse3 .cse78) (or .cse23 .cse16 .cse3 .cse15) (or .cse23 .cse51 .cse79))) (or (let ((.cse80 (or (forall ((v_prenex_6018 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6018) c_aws_linked_list_insert_before_~before.base) .cse4)))) .cse3 (forall ((v_prenex_6019 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6019) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))))) (.cse81 (forall ((v_prenex_6020 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6020) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (.cse82 (or (forall ((v_prenex_6016 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6016) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6017 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6017) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse83 (or (forall ((v_prenex_6022 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6022) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6021 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6021) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))))) (and .cse80 .cse81 .cse82 .cse83 .cse15 (or .cse50 (and .cse80 .cse81 .cse82 .cse83 .cse84)))) .cse12 .cse25 .cse51) (or .cse3 .cse51 (and .cse67 .cse68 .cse64 (or .cse63 (and .cse64 .cse65)))) (or (let ((.cse93 (forall ((v_prenex_6219 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6219) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse94 (forall ((v_prenex_6218 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6218) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse90 (forall ((v_prenex_6220 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6220) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse91 (or (forall ((v_prenex_6221 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6221) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6222 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6222) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse92 (or (forall ((v_prenex_6225 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6225) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6224 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6224) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse88 (forall ((v_prenex_6223 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6223) c_aws_linked_list_insert_before_~before.base) .cse4)))) (.cse89 (forall ((v_prenex_6226 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6226) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))))) (let ((.cse86 (or .cse12 (and (or .cse93 .cse3 .cse94) .cse90 .cse91 .cse92 (or .cse3 .cse88 .cse89)))) (.cse85 (or (forall ((v_prenex_6216 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6216) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6217 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6217) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))))) (and (or .cse50 (and .cse85 .cse86 .cse54)) .cse85 .cse86 .cse54 (or .cse3 (let ((.cse87 (or (and (or .cse88 .cse89) .cse90 .cse91 .cse92 (or .cse93 .cse94)) .cse12))) (and .cse85 .cse70 (or (and .cse85 .cse70 .cse87) .cse50) .cse87)))))) .cse17) (or .cse23 .cse51 .cse18) (or .cse12 .cse3 (and .cse9 (or (forall ((v_prenex_6206 (Array Int Int)) (v_prenex_6204 (Array Int Int))) (let ((.cse95 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6206) c_aws_linked_list_insert_before_~before.base) .cse4)) (.cse96 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6204) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= c_aws_linked_list_insert_before_~to_add.base .cse95) (= .cse95 .cse96) (= c_aws_linked_list_insert_before_~to_add.base .cse96)))) (forall ((v_prenex_6205 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6205) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6207 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6207) c_aws_linked_list_insert_before_~before.base) .cse4))))))) (or .cse23 (and (or (forall ((v_prenex_6058 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6058) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) .cse12 .cse3) (or (and (or (forall ((v_prenex_6057 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6057) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6056 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6056) c_aws_linked_list_insert_before_~before.base) .cse4))))) .cse58) .cse3))) (or (let ((.cse98 (or (forall ((v_prenex_6228 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6228) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6229 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6229) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))))) (.cse99 (or .cse16 (forall ((v_prenex_6227 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6227) c_aws_linked_list_insert_before_~before.base) .cse4))))))) (let ((.cse97 (and .cse98 .cse99 .cse15))) (and .cse44 .cse54 (or .cse97 .cse13) (or .cse3 (and (or .cse97 .cse50) .cse98 .cse99 .cse15))))) .cse12 .cse25 .cse51) (or .cse13 .cse49) (or .cse13 .cse100) (or (and .cse101 .cse69 .cse54 (or .cse3 (and .cse71 .cse72))) .cse23) (or (let ((.cse108 (forall ((v_prenex_6025 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6025) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse109 (forall ((v_prenex_6026 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6026) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (let ((.cse104 (or .cse108 .cse3 .cse109)) (.cse102 (forall ((v_prenex_6027 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6027) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse103 (or (forall ((v_prenex_6028 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6028) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6029 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6029) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))))) (.cse105 (or (forall ((v_prenex_6024 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6024) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6023 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6023) c_aws_linked_list_insert_before_~before.base) .cse4))))))) (and .cse102 .cse103 .cse104 (or (and .cse102 .cse103 .cse104 .cse84 .cse105) .cse50) .cse105 .cse15 (or .cse3 (let ((.cse107 (or .cse108 .cse109))) (and .cse102 (or (and .cse102 .cse103 .cse106 .cse107 .cse105) .cse50) .cse103 .cse106 .cse107 .cse105)))))) .cse12 .cse17) (or .cse3 (and .cse110 .cse111 (or .cse50 .cse22) .cse112)) .cse28 (or .cse30 (and (or .cse13 .cse33) (or (and .cse31 .cse32) .cse13) (or .cse13 .cse34)) .cse12) (or .cse23 .cse12 (and (or .cse13 .cse45) (or .cse13 .cse15))) (or .cse24 .cse1) (or .cse23 .cse3 (and .cse70 .cse58 (or .cse12 .cse78))) (or .cse25 .cse51 (and .cse44 .cse84 .cse54)) (or .cse113 .cse25 .cse3 .cse51 .cse15) (or .cse12 .cse25 .cse51 .cse15) (or .cse23 .cse12 .cse51 (let ((.cse118 (forall ((v_prenex_6001 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6001) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse119 (forall ((v_prenex_6000 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6000) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (let ((.cse114 (or (forall ((v_prenex_5998 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5998) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_5999 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5999) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse116 (forall ((v_prenex_6002 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6002) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse120 (or .cse118 .cse3 .cse119)) (.cse117 (or (forall ((v_prenex_6004 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6004) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6003 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6003) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))))) (and (or .cse3 (let ((.cse115 (or .cse118 .cse119))) (and (or .cse50 (and .cse114 .cse115 .cse106 .cse116 .cse117)) .cse114 .cse115 .cse106 .cse116 .cse117))) .cse114 (or .cse50 (and .cse114 .cse84 .cse116 .cse120 .cse117)) .cse116 .cse120 .cse15 .cse117)))) (or .cse3 (let ((.cse122 (or .cse12 .cse1 .cse15))) (and .cse60 (or .cse12 .cse13 .cse1) (or (and .cse121 .cse122) .cse63) .cse122))) (or .cse23 .cse12 .cse26) .cse66 (or .cse3 (and .cse123 .cse124 (or .cse50 .cse100) .cse125)) (or .cse23 (and (or .cse13 (and (or .cse12 (and (or (forall ((v_prenex_6136 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6136) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)) (forall ((v_prenex_6129 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6129) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (or (forall ((v_prenex_6132 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6132) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6125 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6125) c_aws_linked_list_insert_before_~before.base) .cse4))))) (forall ((v_prenex_6126 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6126) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (or (forall ((v_prenex_6133 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6133) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6135 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6135) c_aws_linked_list_insert_before_~before.base) .cse4))))) (forall ((v_prenex_6130 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6130) c_aws_linked_list_insert_before_~before.base) .cse4)))) (or (forall ((v_prenex_6123 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6123) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6124 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6124) c_aws_linked_list_insert_before_~before.base) .cse4))))))) (or (forall ((v_prenex_6134 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6134) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6128 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6128) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)))) (or (forall ((v_prenex_6127 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6127) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6131 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6131) c_aws_linked_list_insert_before_~before.base) .cse4))))))) (or .cse12 (and (or .cse3 (forall ((v_prenex_3557 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_3557) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_3558 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_3558) c_aws_linked_list_insert_before_~before.base) .cse4))))) (forall ((v_prenex_3561 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_3561) c_aws_linked_list_insert_before_~before.base) .cse4)))) .cse84 (or (forall ((v_prenex_3562 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_3562) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_3563 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_3563) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or .cse3 (forall ((v_prenex_3564 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_3564) c_aws_linked_list_insert_before_~before.base) .cse4))))) (or (forall ((v_prenex_3559 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_3559) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_3560 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_3560) c_aws_linked_list_insert_before_~before.base) .cse4))))))) (or .cse3 (forall ((v_prenex_6138 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6138) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6137 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6137) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)))) .cse76 (or (and (or .cse12 (and (or (forall ((v_prenex_6112 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6112) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6111 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6111) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (or (forall ((v_prenex_6119 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6119) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_6113 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6113) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (or (forall ((v_prenex_6120 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6120) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6121 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6121) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (or (forall ((v_prenex_6116 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6116) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6122 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6122) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_6114 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6114) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6117 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6117) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (or (forall ((v_prenex_6115 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6115) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6118 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6118) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)))) .cse77) .cse3)) .cse51) (or .cse25 .cse24) (or .cse23 (let ((.cse131 (or (forall ((v_prenex_6013 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6013) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_6015 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6015) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))))) (.cse133 (forall ((v_prenex_6008 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6008) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse134 (forall ((v_prenex_6007 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6007) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse132 (or (forall ((v_prenex_6011 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6011) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6010 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6010) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse136 (forall ((v_prenex_6014 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6014) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse137 (forall ((v_prenex_6012 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6012) c_aws_linked_list_insert_before_~before.base) .cse4)))) (.cse135 (forall ((v_prenex_6009 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6009) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (let ((.cse127 (or (forall ((v_prenex_6005 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6005) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_6006 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6006) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse128 (or .cse12 (and .cse131 (or .cse133 .cse134) .cse132 (or .cse136 .cse137) .cse135)))) (let ((.cse130 (and .cse127 .cse70 .cse128))) (let ((.cse126 (or .cse13 .cse130)) (.cse129 (or .cse12 (and .cse131 .cse132 (or .cse3 .cse133 .cse134) .cse135 (or .cse136 .cse137 .cse3))))) (and (or .cse3 (and .cse126 .cse127 .cse70 .cse128)) .cse126 .cse127 .cse129 .cse54 (or .cse50 (and .cse127 .cse129 (or .cse3 .cse130) .cse54))))))) .cse51) .cse29 (or .cse12 .cse13 (forall ((v_prenex_5991 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_5991) c_aws_linked_list_insert_before_~before.base) .cse4)))) (or .cse12 (let ((.cse138 (or (forall ((v_prenex_6194 (Array Int Int)) (v_prenex_6192 (Array Int Int))) (let ((.cse153 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6192) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse153 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6194) c_aws_linked_list_insert_before_~before.base) .cse4)) (= c_aws_linked_list_insert_before_~to_add.base .cse153)))) (forall ((v_prenex_6193 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6193) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6195 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6195) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse139 (or (forall ((v_prenex_6197 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6197) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6198 (Array Int Int)) (v_prenex_6196 (Array Int Int))) (let ((.cse152 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6196) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6198) c_aws_linked_list_insert_before_~before.base) .cse4) .cse152) (= c_aws_linked_list_insert_before_~to_add.base .cse152)))) (forall ((v_prenex_6199 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6199) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse140 (or (forall ((v_prenex_6187 (Array Int Int)) (v_prenex_6186 (Array Int Int))) (let ((.cse151 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6187) c_aws_linked_list_insert_before_~before.base) .cse4)) (.cse150 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6186) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse150 .cse151) (= c_aws_linked_list_insert_before_~to_add.base .cse151) (= .cse150 c_aws_linked_list_insert_before_~to_add.base)))) (forall ((v_prenex_6201 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6201) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6188 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6188) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))))) (.cse141 (or (forall ((v_prenex_6185 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6185) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6183 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6183) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6184 (Array Int Int)) (v_prenex_6182 (Array Int Int))) (let ((.cse148 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6182) c_aws_linked_list_insert_before_~before.base) .cse4)) (.cse149 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6184) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse148 c_aws_linked_list_insert_before_~to_add.base) (= .cse148 .cse149) (= c_aws_linked_list_insert_before_~to_add.base .cse149)))))) (.cse142 (or (forall ((v_prenex_6189 (Array Int Int)) (v_prenex_6190 (Array Int Int))) (let ((.cse147 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6189) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6190) c_aws_linked_list_insert_before_~before.base) .cse4) .cse147) (= c_aws_linked_list_insert_before_~to_add.base .cse147)))) (forall ((v_prenex_6191 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6191) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))))) (.cse143 (or (forall ((v_prenex_6202 (Array Int Int)) (v_prenex_6200 (Array Int Int))) (let ((.cse145 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6202) c_aws_linked_list_insert_before_~before.base) .cse4)) (.cse146 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6200) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= c_aws_linked_list_insert_before_~to_add.base .cse145) (= .cse146 .cse145) (= c_aws_linked_list_insert_before_~to_add.base .cse146)))) (forall ((v_prenex_6203 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6203) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))))) (let ((.cse144 (and .cse138 .cse139 .cse140 .cse6 .cse141 .cse142 .cse143))) (and (or (and .cse138 .cse139 .cse140 .cse6 .cse141 .cse142 .cse143 (or .cse50 .cse144)) .cse3) .cse28 .cse29 (or .cse13 .cse144))))) (or .cse59 .cse3 .cse17) (or .cse12 .cse25 (let ((.cse154 (or (forall ((v_prenex_6052 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6052) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6051 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6051) c_aws_linked_list_insert_before_~before.base) .cse4))))) (.cse155 (forall ((v_prenex_6050 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6050) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base)))) (.cse156 (or .cse113 .cse51 .cse15)) (.cse158 (or (forall ((v_prenex_6054 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6054) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6053 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6053) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6055 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6055) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse159 (or (forall ((v_prenex_6048 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6048) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6049 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6049) c_aws_linked_list_insert_before_~before.base) .cse4))))))) (let ((.cse157 (and .cse154 .cse155 .cse156 .cse158 .cse159))) (and (or .cse3 (and .cse154 .cse155 .cse156 (or .cse50 .cse157) .cse158 .cse159)) .cse160 (or .cse13 .cse157) .cse44)))) (or .cse25 .cse51 .cse18) (or .cse24 .cse14) (or (let ((.cse161 (or (forall ((v_prenex_6106 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6106) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6104 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6104) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6103 (Array Int Int)) (v_prenex_6105 (Array Int Int))) (let ((.cse171 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6103) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse171 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6105) c_aws_linked_list_insert_before_~before.base) .cse4)) (not (= c_aws_linked_list_insert_before_~to_add.base .cse171))))))) (.cse162 (or (forall ((v_prenex_6093 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6093) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6094 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6094) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6092 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6092) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse164 (or (forall ((v_prenex_6091 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6091) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6089 (Array Int Int)) (v_prenex_6090 (Array Int Int))) (let ((.cse170 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6089) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (= .cse170 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6090) c_aws_linked_list_insert_before_~before.base) .cse4)) (not (= .cse170 c_aws_linked_list_insert_before_~to_add.base))))))) (.cse165 (or (forall ((v_prenex_6097 (Array Int Int))) (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6097) c_aws_linked_list_insert_before_~before.base) .cse4))) (forall ((v_prenex_6096 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6096) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_6098 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6098) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6095 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6095) c_aws_linked_list_insert_before_~before.base) .cse4)))))) (.cse166 (or (forall ((v_prenex_6101 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6101) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)) (forall ((v_prenex_6102 (Array Int Int))) (not (= c_aws_linked_list_insert_before_~before.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6102) c_aws_linked_list_insert_before_~before.base) .cse4)))) (forall ((v_prenex_6099 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6099) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base))) (forall ((v_prenex_6100 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6100) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)))) (.cse167 (or (forall ((v_prenex_6110 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6110) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~before.base))) (forall ((v_prenex_6107 (Array Int Int)) (v_prenex_6109 (Array Int Int))) (let ((.cse169 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6107) c_aws_linked_list_insert_before_~before.base) .cse4))) (or (not (= .cse169 c_aws_linked_list_insert_before_~to_add.base)) (= .cse169 (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6109) c_aws_linked_list_insert_before_~before.base) .cse4))))) (forall ((v_prenex_6108 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base v_prenex_6108) c_aws_linked_list_insert_before_~before.base) .cse4) c_aws_linked_list_insert_before_~to_add.base)))))) (let ((.cse163 (and .cse161 .cse162 .cse164 .cse165 .cse166 .cse167 .cse168))) (and (or .cse3 (and .cse161 .cse162 (or .cse163 .cse50) .cse164 .cse165 .cse166 .cse167 .cse168)) .cse61 .cse62 (or .cse13 .cse163)))) .cse12) (or .cse25 (and (or .cse3 .cse51 .cse15) .cse44 .cse54 (or .cse113 .cse3 .cse51 .cse15)))))))))) is different from true [2022-11-16 11:59:41,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763619030] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:59:41,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:59:41,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2022-11-16 11:59:41,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728532966] [2022-11-16 11:59:41,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:59:41,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 11:59:41,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:41,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 11:59:41,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1167, Unknown=1, NotChecked=68, Total=1332 [2022-11-16 11:59:41,550 INFO L87 Difference]: Start difference. First operand 188 states and 242 transitions. Second operand has 29 states, 26 states have (on average 2.923076923076923) internal successors, (76), 24 states have internal predecessors, (76), 10 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-11-16 11:59:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:46,870 INFO L93 Difference]: Finished difference Result 219 states and 286 transitions. [2022-11-16 11:59:46,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 11:59:46,871 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.923076923076923) internal successors, (76), 24 states have internal predecessors, (76), 10 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) Word has length 102 [2022-11-16 11:59:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:46,873 INFO L225 Difference]: With dead ends: 219 [2022-11-16 11:59:46,873 INFO L226 Difference]: Without dead ends: 217 [2022-11-16 11:59:46,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=209, Invalid=2344, Unknown=1, NotChecked=98, Total=2652 [2022-11-16 11:59:46,875 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 65 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 2235 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 211 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:46,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 2235 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1333 Invalid, 0 Unknown, 211 Unchecked, 3.3s Time] [2022-11-16 11:59:46,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-16 11:59:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 199. [2022-11-16 11:59:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 135 states have (on average 1.125925925925926) internal successors, (152), 140 states have internal predecessors, (152), 45 states have call successors, (45), 15 states have call predecessors, (45), 18 states have return successors, (55), 43 states have call predecessors, (55), 44 states have call successors, (55) [2022-11-16 11:59:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 252 transitions. [2022-11-16 11:59:46,923 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 252 transitions. Word has length 102 [2022-11-16 11:59:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:46,925 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 252 transitions. [2022-11-16 11:59:46,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.923076923076923) internal successors, (76), 24 states have internal predecessors, (76), 10 states have call successors, (22), 5 states have call predecessors, (22), 3 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-11-16 11:59:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 252 transitions. [2022-11-16 11:59:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-16 11:59:46,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:46,931 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:46,943 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:59:47,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_779af1cd-321e-4068-b216-6ab6f9c16c30/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:59:47,141 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:59:47,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:47,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1303128156, now seen corresponding path program 1 times [2022-11-16 11:59:47,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:47,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970761340] [2022-11-16 11:59:47,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:47,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:59:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:59:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:59:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:59:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:59:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:59:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:59:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:59:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:59:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:59:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 11:59:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 11:59:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 11:59:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-16 11:59:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-16 11:59:52,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:52,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970761340] [2022-11-16 11:59:52,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970761340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:52,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:52,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-16 11:59:52,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591524133] [2022-11-16 11:59:52,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:52,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:59:52,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:52,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:59:52,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:59:52,845 INFO L87 Difference]: Start difference. First operand 199 states and 252 transitions. Second operand has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-16 11:59:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:59:55,054 INFO L93 Difference]: Finished difference Result 225 states and 292 transitions. [2022-11-16 11:59:55,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:59:55,058 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 117 [2022-11-16 11:59:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:59:55,060 INFO L225 Difference]: With dead ends: 225 [2022-11-16 11:59:55,060 INFO L226 Difference]: Without dead ends: 223 [2022-11-16 11:59:55,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:59:55,061 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 62 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:59:55,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1323 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-16 11:59:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-16 11:59:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 204. [2022-11-16 11:59:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 138 states have (on average 1.1231884057971016) internal successors, (155), 143 states have internal predecessors, (155), 46 states have call successors, (46), 16 states have call predecessors, (46), 19 states have return successors, (56), 44 states have call predecessors, (56), 45 states have call successors, (56) [2022-11-16 11:59:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 257 transitions. [2022-11-16 11:59:55,108 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 257 transitions. Word has length 117 [2022-11-16 11:59:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:59:55,108 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 257 transitions. [2022-11-16 11:59:55,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 13 states have internal predecessors, (59), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-16 11:59:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 257 transitions. [2022-11-16 11:59:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-16 11:59:55,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:59:55,111 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:59:55,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:59:55,112 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:59:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:59:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2112474782, now seen corresponding path program 1 times [2022-11-16 11:59:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:59:55,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116664872] [2022-11-16 11:59:55,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:59:55,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:59:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:59:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:59:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:59:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:59:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:59:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:59:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 11:59:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:59:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:59:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:59:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 11:59:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 11:59:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 11:59:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-16 11:59:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:59:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-16 11:59:58,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:59:58,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116664872] [2022-11-16 11:59:58,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116664872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:59:58,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:59:58,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-16 11:59:58,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214302618] [2022-11-16 11:59:58,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:59:58,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:59:58,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:58,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:59:58,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:59:58,642 INFO L87 Difference]: Start difference. First operand 204 states and 257 transitions. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 8 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-11-16 12:00:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:00,656 INFO L93 Difference]: Finished difference Result 308 states and 391 transitions. [2022-11-16 12:00:00,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:00:00,656 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 8 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 117 [2022-11-16 12:00:00,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:00,659 INFO L225 Difference]: With dead ends: 308 [2022-11-16 12:00:00,659 INFO L226 Difference]: Without dead ends: 215 [2022-11-16 12:00:00,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:00:00,660 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 81 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:00,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1024 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-16 12:00:00,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-16 12:00:00,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 209. [2022-11-16 12:00:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 142 states have (on average 1.1267605633802817) internal successors, (160), 148 states have internal predecessors, (160), 46 states have call successors, (46), 16 states have call predecessors, (46), 20 states have return successors, (58), 44 states have call predecessors, (58), 45 states have call successors, (58) [2022-11-16 12:00:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 264 transitions. [2022-11-16 12:00:00,708 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 264 transitions. Word has length 117 [2022-11-16 12:00:00,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:00,709 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 264 transitions. [2022-11-16 12:00:00,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 8 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-11-16 12:00:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 264 transitions. [2022-11-16 12:00:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-16 12:00:00,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:00,711 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:00,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 12:00:00,711 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:00:00,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:00,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1789465504, now seen corresponding path program 1 times [2022-11-16 12:00:00,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:00:00,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784100378] [2022-11-16 12:00:00,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:00:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:00:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 12:00:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 12:00:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:00:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 12:00:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:00:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:00:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:00:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 12:00:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:00:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:00:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 12:00:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:00:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-16 12:00:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-16 12:00:01,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:00:01,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784100378] [2022-11-16 12:00:01,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784100378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:00:01,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:00:01,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:00:01,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909071610] [2022-11-16 12:00:01,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:00:01,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:00:01,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:00:01,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:00:01,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:00:01,467 INFO L87 Difference]: Start difference. First operand 209 states and 264 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-11-16 12:00:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:02,172 INFO L93 Difference]: Finished difference Result 319 states and 406 transitions. [2022-11-16 12:00:02,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:00:02,173 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 117 [2022-11-16 12:00:02,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:02,175 INFO L225 Difference]: With dead ends: 319 [2022-11-16 12:00:02,175 INFO L226 Difference]: Without dead ends: 216 [2022-11-16 12:00:02,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:00:02,177 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 46 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:02,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 989 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 12:00:02,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-16 12:00:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2022-11-16 12:00:02,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 144 states have (on average 1.125) internal successors, (162), 151 states have internal predecessors, (162), 45 states have call successors, (45), 16 states have call predecessors, (45), 21 states have return successors, (59), 43 states have call predecessors, (59), 44 states have call successors, (59) [2022-11-16 12:00:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 266 transitions. [2022-11-16 12:00:02,229 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 266 transitions. Word has length 117 [2022-11-16 12:00:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:02,230 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 266 transitions. [2022-11-16 12:00:02,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 6 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-11-16 12:00:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 266 transitions. [2022-11-16 12:00:02,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 12:00:02,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:02,232 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:00:02,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 12:00:02,233 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:00:02,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1263280266, now seen corresponding path program 1 times [2022-11-16 12:00:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:00:02,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569588229] [2022-11-16 12:00:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:00:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat