./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_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_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/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_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/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_e39c0904-4a35-434c-a84b-8a57b5c85732/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 edd3fac09d24fc037292743bb080afb788cb886b05d29648be5f73c1396cfbb6 --- 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:24:52,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:24:52,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:24:52,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:24:52,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:24:52,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:24:52,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:24:52,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:24:52,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:24:52,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:24:52,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:24:52,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:24:52,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:24:52,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:24:52,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:24:52,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:24:52,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:24:52,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:24:52,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:24:52,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:24:52,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:24:52,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:24:52,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:24:52,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:24:52,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:24:52,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:24:52,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:24:52,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:24:52,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:24:52,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:24:52,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:24:52,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:24:52,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:24:52,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:24:52,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:24:52,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:24:52,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:24:52,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:24:52,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:24:52,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:24:52,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:24:52,421 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 11:24:52,462 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:24:52,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:24:52,463 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:24:52,464 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:24:52,465 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:24:52,465 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:24:52,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:24:52,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:24:52,467 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:24:52,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:24:52,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:24:52,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:24:52,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:24:52,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:24:52,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:24:52,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:24:52,471 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:24:52,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:24:52,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:24:52,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:24:52,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:24:52,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:24:52,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:24:52,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:24:52,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:24:52,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:24:52,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:24:52,475 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:24:52,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:24:52,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:24:52,476 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_e39c0904-4a35-434c-a84b-8a57b5c85732/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_e39c0904-4a35-434c-a84b-8a57b5c85732/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 -> edd3fac09d24fc037292743bb080afb788cb886b05d29648be5f73c1396cfbb6 [2022-11-16 11:24:52,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:24:52,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:24:52,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:24:52,846 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:24:52,847 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:24:52,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i [2022-11-16 11:24:52,966 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/data/e4bd52089/478b24afa50343b1874883756eb0d018/FLAG5543a4d20 [2022-11-16 11:24:53,858 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:24:53,859 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i [2022-11-16 11:24:53,908 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/data/e4bd52089/478b24afa50343b1874883756eb0d018/FLAG5543a4d20 [2022-11-16 11:24:53,927 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/data/e4bd52089/478b24afa50343b1874883756eb0d018 [2022-11-16 11:24:53,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:24:53,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:24:53,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:24:53,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:24:53,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:24:53,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:24:53" (1/1) ... [2022-11-16 11:24:53,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4803138f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:24:53, skipping insertion in model container [2022-11-16 11:24:53,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:24:53" (1/1) ... [2022-11-16 11:24:53,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:24:54,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:24:54,347 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_e39c0904-4a35-434c-a84b-8a57b5c85732/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[4499,4512] [2022-11-16 11:24:54,353 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_e39c0904-4a35-434c-a84b-8a57b5c85732/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[4559,4572] [2022-11-16 11:24:55,194 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,195 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,195 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,196 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,197 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,217 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,219 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,225 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,229 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,232 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,233 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,234 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,235 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,606 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 11:24:55,608 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 11:24:55,609 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 11:24:55,610 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 11:24:55,611 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 11:24:55,612 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 11:24:55,613 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 11:24:55,613 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 11:24:55,614 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 11:24:55,615 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 11:24:55,780 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 11:24:55,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:24:55,824 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:24:55,840 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_e39c0904-4a35-434c-a84b-8a57b5c85732/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[4499,4512] [2022-11-16 11:24:55,841 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_e39c0904-4a35-434c-a84b-8a57b5c85732/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i[4559,4572] [2022-11-16 11:24:55,927 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,928 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,929 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,929 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,930 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,955 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,965 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,966 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,967 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,968 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,969 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,972 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:55,972 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:24:56,042 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 11:24:56,043 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 11:24:56,044 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 11:24:56,045 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 11:24:56,052 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 11:24:56,053 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 11:24:56,056 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 11:24:56,057 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 11:24:56,057 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 11:24:56,058 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 11:24:56,096 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 11:24:56,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:24:56,411 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:24:56,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:24:56 WrapperNode [2022-11-16 11:24:56,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:24:56,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:24:56,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:24:56,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:24:56,441 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:24:56" (1/1) ... [2022-11-16 11:24:56,524 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:24:56" (1/1) ... [2022-11-16 11:24:56,583 INFO L138 Inliner]: procedures = 679, calls = 1046, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 225 [2022-11-16 11:24:56,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:24:56,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:24:56,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:24:56,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:24:56,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:24:56" (1/1) ... [2022-11-16 11:24:56,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:24:56" (1/1) ... [2022-11-16 11:24:56,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:24:56" (1/1) ... [2022-11-16 11:24:56,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:24:56" (1/1) ... [2022-11-16 11:24:56,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:24:56" (1/1) ... [2022-11-16 11:24:56,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:24:56" (1/1) ... [2022-11-16 11:24:56,628 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:24:56" (1/1) ... [2022-11-16 11:24:56,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:24:56" (1/1) ... [2022-11-16 11:24:56,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:24:56,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:24:56,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:24:56,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:24:56,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:24:56" (1/1) ... [2022-11-16 11:24:56,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:24:56,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:24:56,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:24:56,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:24:56,777 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2022-11-16 11:24:56,777 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2022-11-16 11:24:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2022-11-16 11:24:56,778 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2022-11-16 11:24:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:24:56,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:24:56,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 11:24:56,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 11:24:56,781 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-16 11:24:56,781 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-16 11:24:56,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:24:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-16 11:24:56,783 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-16 11:24:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:24:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:24:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:24:56,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:24:56,785 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-16 11:24:56,785 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-16 11:24:56,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-16 11:24:56,785 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-16 11:24:56,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 11:24:56,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 11:24:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:24:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:24:56,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:24:56,788 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-16 11:24:56,789 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-16 11:24:56,789 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-16 11:24:56,789 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-16 11:24:56,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:24:57,066 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:24:57,069 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:24:57,806 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:24:57,818 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:24:57,820 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-16 11:24:57,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:24:57 BoogieIcfgContainer [2022-11-16 11:24:57,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:24:57,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:24:57,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:24:57,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:24:57,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:24:53" (1/3) ... [2022-11-16 11:24:57,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ebdf21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:24:57, skipping insertion in model container [2022-11-16 11:24:57,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:24:56" (2/3) ... [2022-11-16 11:24:57,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ebdf21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:24:57, skipping insertion in model container [2022-11-16 11:24:57,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:24:57" (3/3) ... [2022-11-16 11:24:57,838 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_front_harness.i [2022-11-16 11:24:57,865 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:24:57,865 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:24:57,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:24:57,961 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;@1c1be89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:24:57,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:24:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-16 11:24:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 11:24:57,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:24:57,985 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:24:57,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:24:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:24:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1579343520, now seen corresponding path program 1 times [2022-11-16 11:24:58,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:24:58,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021279853] [2022-11-16 11:24:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:24:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:24:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:58,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:24:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:58,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:24:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:58,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:24:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:58,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:24:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:24:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:58,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:24:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:58,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:24:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:58,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:24:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:58,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:24:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 11:24:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:59,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 11:24:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 11:24:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:59,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 11:24:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:59,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:24:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:59,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 11:24:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:59,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 11:24:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-11-16 11:24:59,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:24:59,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021279853] [2022-11-16 11:24:59,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021279853] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:24:59,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770110195] [2022-11-16 11:24:59,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:24:59,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:24:59,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:24:59,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:24:59,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:24:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:24:59,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:24:59,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:24:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-16 11:24:59,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:24:59,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770110195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:24:59,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:24:59,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-16 11:24:59,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173861146] [2022-11-16 11:24:59,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:24:59,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:24:59,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:24:59,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:24:59,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:24:59,596 INFO L87 Difference]: Start difference. First operand has 137 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:24:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:24:59,703 INFO L93 Difference]: Finished difference Result 274 states and 414 transitions. [2022-11-16 11:24:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:24:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2022-11-16 11:24:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:24:59,717 INFO L225 Difference]: With dead ends: 274 [2022-11-16 11:24:59,717 INFO L226 Difference]: Without dead ends: 140 [2022-11-16 11:24:59,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 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:24:59,726 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 12 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 536 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:24:59,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 536 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:24:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-16 11:24:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2022-11-16 11:24:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 86 states have (on average 1.244186046511628) internal successors, (107), 87 states have internal predecessors, (107), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-16 11:24:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 180 transitions. [2022-11-16 11:24:59,784 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 180 transitions. Word has length 116 [2022-11-16 11:24:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:24:59,786 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 180 transitions. [2022-11-16 11:24:59,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:24:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2022-11-16 11:24:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 11:24:59,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:24:59,791 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:24:59,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:24:59,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-16 11:24:59,999 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:24:59,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:24:59,999 INFO L85 PathProgramCache]: Analyzing trace with hash -183799078, now seen corresponding path program 1 times [2022-11-16 11:24:59,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:24:59,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536006969] [2022-11-16 11:24:59,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:00,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 11:25:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 11:25:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 11:25:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 11:25:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 11:25:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 11:25:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-11-16 11:25:00,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:00,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536006969] [2022-11-16 11:25:00,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536006969] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:00,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599714116] [2022-11-16 11:25:00,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:00,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:00,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:00,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:00,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:25:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:00,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:25:00,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-16 11:25:00,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:25:00,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599714116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:00,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:25:00,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-16 11:25:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952701372] [2022-11-16 11:25:00,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:00,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:25:00,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:00,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:25:00,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:25:00,753 INFO L87 Difference]: Start difference. First operand 134 states and 180 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:25:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:00,836 INFO L93 Difference]: Finished difference Result 252 states and 345 transitions. [2022-11-16 11:25:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:25:00,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2022-11-16 11:25:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:00,851 INFO L225 Difference]: With dead ends: 252 [2022-11-16 11:25:00,853 INFO L226 Difference]: Without dead ends: 138 [2022-11-16 11:25:00,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 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:25:00,860 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 3 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:00,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 520 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:25:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-16 11:25:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2022-11-16 11:25:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 90 states have internal predecessors, (110), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-16 11:25:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2022-11-16 11:25:00,891 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 116 [2022-11-16 11:25:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:00,894 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2022-11-16 11:25:00,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:25:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2022-11-16 11:25:00,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 11:25:00,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:00,904 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:00,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:01,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:01,111 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:01,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:01,111 INFO L85 PathProgramCache]: Analyzing trace with hash -543175276, now seen corresponding path program 1 times [2022-11-16 11:25:01,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:01,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173644743] [2022-11-16 11:25:01,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:01,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 11:25:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 11:25:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 11:25:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 11:25:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 11:25:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 11:25:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-11-16 11:25:02,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:02,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173644743] [2022-11-16 11:25:02,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173644743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:02,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488704570] [2022-11-16 11:25:02,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:02,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:02,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:02,777 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:02,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:25:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:03,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 11:25:03,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:03,188 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 14 treesize of output 15 [2022-11-16 11:25:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-16 11:25:04,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:25:04,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488704570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:04,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:25:04,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 18 [2022-11-16 11:25:04,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815640223] [2022-11-16 11:25:04,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:04,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:25:04,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:04,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:25:04,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:25:04,096 INFO L87 Difference]: Start difference. First operand 137 states and 183 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2022-11-16 11:25:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:04,377 INFO L93 Difference]: Finished difference Result 327 states and 442 transitions. [2022-11-16 11:25:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:25:04,378 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) Word has length 116 [2022-11-16 11:25:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:04,388 INFO L225 Difference]: With dead ends: 327 [2022-11-16 11:25:04,389 INFO L226 Difference]: Without dead ends: 213 [2022-11-16 11:25:04,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 130 SyntacticMatches, 13 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:25:04,395 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 59 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:04,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 769 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 104 Unchecked, 0.1s Time] [2022-11-16 11:25:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-16 11:25:04,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 179. [2022-11-16 11:25:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 119 states have (on average 1.2100840336134453) internal successors, (144), 122 states have internal predecessors, (144), 45 states have call successors, (45), 13 states have call predecessors, (45), 14 states have return successors, (47), 43 states have call predecessors, (47), 44 states have call successors, (47) [2022-11-16 11:25:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 236 transitions. [2022-11-16 11:25:04,452 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 236 transitions. Word has length 116 [2022-11-16 11:25:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:04,455 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 236 transitions. [2022-11-16 11:25:04,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2022-11-16 11:25:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 236 transitions. [2022-11-16 11:25:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 11:25:04,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:04,463 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:25:04,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:04,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:04,676 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash -670206630, now seen corresponding path program 1 times [2022-11-16 11:25:04,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:04,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162567173] [2022-11-16 11:25:04,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 11:25:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 11:25:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 11:25:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 11:25:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 11:25:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 11:25:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-11-16 11:25:05,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:05,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162567173] [2022-11-16 11:25:05,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162567173] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:05,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175056706] [2022-11-16 11:25:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:05,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:05,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:05,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:05,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:25:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:06,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 11:25:06,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:06,196 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:25:06,196 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:25:06,213 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:25:06,214 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:25:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-16 11:25:07,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:25:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-16 11:25:08,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175056706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:25:08,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:25:08,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 11] total 29 [2022-11-16 11:25:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007499478] [2022-11-16 11:25:08,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:08,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 11:25:08,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:08,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 11:25:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2022-11-16 11:25:08,417 INFO L87 Difference]: Start difference. First operand 179 states and 236 transitions. Second operand has 29 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 28 states have internal predecessors, (95), 11 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 9 states have call predecessors, (35), 11 states have call successors, (35) [2022-11-16 11:25:11,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:11,704 INFO L93 Difference]: Finished difference Result 436 states and 617 transitions. [2022-11-16 11:25:11,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:25:11,705 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 28 states have internal predecessors, (95), 11 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 9 states have call predecessors, (35), 11 states have call successors, (35) Word has length 116 [2022-11-16 11:25:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:11,708 INFO L225 Difference]: With dead ends: 436 [2022-11-16 11:25:11,709 INFO L226 Difference]: Without dead ends: 314 [2022-11-16 11:25:11,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 244 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=399, Invalid=2463, Unknown=0, NotChecked=0, Total=2862 [2022-11-16 11:25:11,711 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 307 mSDsluCounter, 2742 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 378 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:11,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 3010 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1437 Invalid, 0 Unknown, 378 Unchecked, 1.6s Time] [2022-11-16 11:25:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-16 11:25:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 226. [2022-11-16 11:25:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 149 states have (on average 1.1812080536912752) internal successors, (176), 152 states have internal predecessors, (176), 58 states have call successors, (58), 17 states have call predecessors, (58), 18 states have return successors, (73), 56 states have call predecessors, (73), 57 states have call successors, (73) [2022-11-16 11:25:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 307 transitions. [2022-11-16 11:25:11,746 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 307 transitions. Word has length 116 [2022-11-16 11:25:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:11,747 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 307 transitions. [2022-11-16 11:25:11,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 28 states have internal predecessors, (95), 11 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (35), 9 states have call predecessors, (35), 11 states have call successors, (35) [2022-11-16 11:25:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 307 transitions. [2022-11-16 11:25:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 11:25:11,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:11,750 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:11,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 11:25:11,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:11,956 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1395986770, now seen corresponding path program 1 times [2022-11-16 11:25:11,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:11,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453113063] [2022-11-16 11:25:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 11:25:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 11:25:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 11:25:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 11:25:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 11:25:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 11:25:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-16 11:25:12,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:12,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453113063] [2022-11-16 11:25:12,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453113063] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:12,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440269251] [2022-11-16 11:25:12,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:12,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:12,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:12,588 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:12,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:25:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:12,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:25:12,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-11-16 11:25:12,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:25:12,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440269251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:12,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:25:12,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-11-16 11:25:12,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743847408] [2022-11-16 11:25:12,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:12,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:25:12,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:12,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:25:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:25:12,971 INFO L87 Difference]: Start difference. First operand 226 states and 307 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-16 11:25:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:13,304 INFO L93 Difference]: Finished difference Result 417 states and 561 transitions. [2022-11-16 11:25:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:25:13,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 116 [2022-11-16 11:25:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:13,308 INFO L225 Difference]: With dead ends: 417 [2022-11-16 11:25:13,309 INFO L226 Difference]: Without dead ends: 187 [2022-11-16 11:25:13,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:25:13,312 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 245 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:13,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 724 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:25:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-16 11:25:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2022-11-16 11:25:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 117 states have (on average 1.1794871794871795) internal successors, (138), 119 states have internal predecessors, (138), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (53), 48 states have call predecessors, (53), 49 states have call successors, (53) [2022-11-16 11:25:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 241 transitions. [2022-11-16 11:25:13,355 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 241 transitions. Word has length 116 [2022-11-16 11:25:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:13,358 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 241 transitions. [2022-11-16 11:25:13,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-16 11:25:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 241 transitions. [2022-11-16 11:25:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-16 11:25:13,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:13,361 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:25:13,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:13,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:13,568 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:13,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:13,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1369878566, now seen corresponding path program 2 times [2022-11-16 11:25:13,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:13,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888568127] [2022-11-16 11:25:13,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:13,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 11:25:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-16 11:25:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-16 11:25:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 11:25:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 11:25:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 11:25:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-11-16 11:25:14,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:14,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888568127] [2022-11-16 11:25:14,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888568127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:14,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711299069] [2022-11-16 11:25:14,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:25:14,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:14,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:14,603 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:14,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:25:14,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:25:14,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:25:14,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 11:25:14,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:14,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:25:14,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-16 11:25:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-11-16 11:25:17,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:25:17,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711299069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:17,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:25:17,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2022-11-16 11:25:17,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025027367] [2022-11-16 11:25:17,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:17,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:25:17,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:17,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:25:17,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-11-16 11:25:17,389 INFO L87 Difference]: Start difference. First operand 183 states and 241 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-11-16 11:25:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:17,790 INFO L93 Difference]: Finished difference Result 403 states and 542 transitions. [2022-11-16 11:25:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:25:17,791 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 116 [2022-11-16 11:25:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:17,793 INFO L225 Difference]: With dead ends: 403 [2022-11-16 11:25:17,793 INFO L226 Difference]: Without dead ends: 277 [2022-11-16 11:25:17,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 119 SyntacticMatches, 20 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:25:17,797 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 65 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:17,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1504 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 203 Unchecked, 0.2s Time] [2022-11-16 11:25:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-16 11:25:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 233. [2022-11-16 11:25:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 154 states have (on average 1.1948051948051948) internal successors, (184), 156 states have internal predecessors, (184), 58 states have call successors, (58), 20 states have call predecessors, (58), 20 states have return successors, (65), 56 states have call predecessors, (65), 57 states have call successors, (65) [2022-11-16 11:25:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 307 transitions. [2022-11-16 11:25:17,847 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 307 transitions. Word has length 116 [2022-11-16 11:25:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:17,850 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 307 transitions. [2022-11-16 11:25:17,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-11-16 11:25:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 307 transitions. [2022-11-16 11:25:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-16 11:25:17,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:17,853 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:17,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:18,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 11:25:18,061 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:18,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:18,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1492302642, now seen corresponding path program 1 times [2022-11-16 11:25:18,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:18,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644406880] [2022-11-16 11:25:18,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:18,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:25:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 11:25:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:25:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:25:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:25:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 11:25:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 11:25:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 11:25:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-16 11:25:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:25:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:25:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-11-16 11:25:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:18,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644406880] [2022-11-16 11:25:18,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644406880] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:18,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195982951] [2022-11-16 11:25:18,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:18,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:18,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:18,597 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:18,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:25:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:18,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 11:25:18,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:18,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:25:19,060 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:25:19,061 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 11 treesize of output 11 [2022-11-16 11:25:19,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 11:25:19,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:25:19,160 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-16 11:25:19,161 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 73 treesize of output 99 [2022-11-16 11:25:19,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:25:19,170 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 85 treesize of output 71 [2022-11-16 11:25:19,178 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:25:19,316 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_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17|)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| v_DerPreprocessor_2) .cse0)))))) is different from true [2022-11-16 11:25:19,528 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 0)) (= (select v_DerPreprocessor_4 24) (select .cse1 24)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18| v_DerPreprocessor_4) .cse0 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18| v_DerPreprocessor_4) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18|)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 0)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17|)) (= (select .cse3 24) (select v_DerPreprocessor_2 24)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| v_DerPreprocessor_2) .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| v_DerPreprocessor_2) .cse2))))))) is different from true [2022-11-16 11:25:19,978 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (let ((.cse0 (select .cse1 0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_6) .cse0 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_6) .cse0)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| .cse0)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_6 24)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 0)) (= (select v_DerPreprocessor_4 24) (select .cse3 24)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18| v_DerPreprocessor_4) .cse2)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18|)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17|))) (let ((.cse4 (select .cse5 0))) (and (not (= .cse4 0)) (not (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17|)) (= (select .cse5 24) (select v_DerPreprocessor_2 24)) (= (select |c_#memory_$Pointer$.base| .cse4) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| v_DerPreprocessor_2) .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| v_DerPreprocessor_2) .cse4))))))) is different from true [2022-11-16 11:25:20,549 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (let ((.cse1 (select .cse0 0))) (and (= (select .cse0 24) (select v_DerPreprocessor_8 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| .cse1)) (= (select |c_#memory_$Pointer$.base| .cse1) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_8) .cse1 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_8) .cse1)) (not (= .cse1 0)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 0)) (= (select v_DerPreprocessor_4 24) (select .cse3 24)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18| v_DerPreprocessor_4) .cse2)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|))) (let ((.cse4 (select .cse5 0))) (and (not (= .cse4 0)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| .cse4)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_6) .cse4 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_6) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (= (select .cse5 24) (select v_DerPreprocessor_6 24)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17|))) (let ((.cse6 (select .cse7 0))) (and (not (= .cse6 0)) (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17|)) (= (select .cse7 24) (select v_DerPreprocessor_2 24)) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| v_DerPreprocessor_2) .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| v_DerPreprocessor_2) .cse6))))))) is different from true [2022-11-16 11:25:21,117 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16|))) (let ((.cse0 (select .cse1 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| .cse0)) (= (select v_DerPreprocessor_8 24) (select .cse1 24)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_8) .cse0 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_16| v_DerPreprocessor_8) .cse0)) (not (= .cse0 0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 0)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| .cse2)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_11) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_12) .cse2 v_DerPreprocessor_11) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_14| v_DerPreprocessor_12) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (= (select .cse3 24) (select v_DerPreprocessor_12 24)))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| Int) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13|))) (let ((.cse5 (select .cse4 0))) (and (= (select v_DerPreprocessor_10 24) (select .cse4 24)) (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_10) .cse5 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| v_DerPreprocessor_10) .cse5)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_13| .cse5)) (not (= .cse5 0)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18|))) (let ((.cse6 (select .cse7 0))) (and (not (= .cse6 0)) (= (select v_DerPreprocessor_4 24) (select .cse7 24)) (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18| v_DerPreprocessor_4) .cse6 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18| v_DerPreprocessor_4) .cse6)) (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_18|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| Int) (v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15|))) (let ((.cse8 (select .cse9 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| .cse8)) (= (select .cse9 24) (select v_DerPreprocessor_6 24)) (not (= .cse8 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_6) .cse8 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_15| v_DerPreprocessor_6) .cse8) (select |c_#memory_$Pointer$.base| .cse8)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17|))) (let ((.cse10 (select .cse11 0))) (and (not (= .cse10 0)) (not (= .cse10 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17|)) (= (select .cse11 24) (select v_DerPreprocessor_2 24)) (= (select |c_#memory_$Pointer$.base| .cse10) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| v_DerPreprocessor_2) .cse10 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_17| v_DerPreprocessor_2) .cse10))))))) is different from true [2022-11-16 11:25:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 45 not checked. [2022-11-16 11:25:22,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:25:23,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:25:23,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-11-16 11:25:23,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:25:23,395 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 154 treesize of output 156 [2022-11-16 11:25:23,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 144 treesize of output 140 [2022-11-16 11:25:23,414 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 140 treesize of output 138 [2022-11-16 11:25:23,487 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:25:23,518 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 24 treesize of output 22 [2022-11-16 11:25:23,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:25:23,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2022-11-16 11:25:24,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195982951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:24,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:25:24,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 21] total 25 [2022-11-16 11:25:24,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979594341] [2022-11-16 11:25:24,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:24,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 11:25:24,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:24,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 11:25:24,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=708, Unknown=26, NotChecked=290, Total=1122 [2022-11-16 11:25:24,007 INFO L87 Difference]: Start difference. First operand 233 states and 307 transitions. Second operand has 25 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 11 states have call successors, (31), 8 states have call predecessors, (31), 10 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-11-16 11:25:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:25,237 INFO L93 Difference]: Finished difference Result 477 states and 620 transitions. [2022-11-16 11:25:25,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-16 11:25:25,238 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 11 states have call successors, (31), 8 states have call predecessors, (31), 10 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) Word has length 118 [2022-11-16 11:25:25,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:25,240 INFO L225 Difference]: With dead ends: 477 [2022-11-16 11:25:25,240 INFO L226 Difference]: Without dead ends: 279 [2022-11-16 11:25:25,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=156, Invalid=1444, Unknown=60, NotChecked=410, Total=2070 [2022-11-16 11:25:25,242 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 27 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1482 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:25,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1789 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 1482 Unchecked, 0.2s Time] [2022-11-16 11:25:25,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-16 11:25:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2022-11-16 11:25:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 182 states have (on average 1.1703296703296704) internal successors, (213), 187 states have internal predecessors, (213), 63 states have call successors, (63), 27 states have call predecessors, (63), 29 states have return successors, (75), 60 states have call predecessors, (75), 62 states have call successors, (75) [2022-11-16 11:25:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 351 transitions. [2022-11-16 11:25:25,278 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 351 transitions. Word has length 118 [2022-11-16 11:25:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:25,279 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 351 transitions. [2022-11-16 11:25:25,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 11 states have call successors, (31), 8 states have call predecessors, (31), 10 states have return successors, (30), 10 states have call predecessors, (30), 11 states have call successors, (30) [2022-11-16 11:25:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 351 transitions. [2022-11-16 11:25:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-16 11:25:25,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:25,289 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:25,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:25,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 11:25:25,496 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:25,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:25,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1991074974, now seen corresponding path program 1 times [2022-11-16 11:25:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:25,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403555038] [2022-11-16 11:25:25,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 11:25:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 11:25:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 11:25:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-16 11:25:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:25:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:25:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-11-16 11:25:25,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:25,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403555038] [2022-11-16 11:25:25,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403555038] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:25,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653700700] [2022-11-16 11:25:25,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:25,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:25,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:25,911 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:25,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:25:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:26,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:25:26,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-16 11:25:26,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:25:26,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653700700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:26,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:25:26,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-11-16 11:25:26,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930605561] [2022-11-16 11:25:26,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:26,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:25:26,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:26,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:25:26,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:25:26,275 INFO L87 Difference]: Start difference. First operand 275 states and 351 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 11:25:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:26,619 INFO L93 Difference]: Finished difference Result 476 states and 621 transitions. [2022-11-16 11:25:26,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:25:26,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 118 [2022-11-16 11:25:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:26,622 INFO L225 Difference]: With dead ends: 476 [2022-11-16 11:25:26,622 INFO L226 Difference]: Without dead ends: 281 [2022-11-16 11:25:26,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:25:26,624 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 213 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:26,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 734 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:25:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-16 11:25:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2022-11-16 11:25:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 185 states have (on average 1.1675675675675676) internal successors, (216), 191 states have internal predecessors, (216), 63 states have call successors, (63), 27 states have call predecessors, (63), 30 states have return successors, (77), 60 states have call predecessors, (77), 62 states have call successors, (77) [2022-11-16 11:25:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 356 transitions. [2022-11-16 11:25:26,665 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 356 transitions. Word has length 118 [2022-11-16 11:25:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:26,665 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 356 transitions. [2022-11-16 11:25:26,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 11:25:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 356 transitions. [2022-11-16 11:25:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-16 11:25:26,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:26,670 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:26,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:26,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:26,876 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:26,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash -267467697, now seen corresponding path program 1 times [2022-11-16 11:25:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:26,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204856694] [2022-11-16 11:25:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-16 11:25:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-16 11:25:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:25:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:25:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 11:25:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 11:25:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-11-16 11:25:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:27,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204856694] [2022-11-16 11:25:27,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204856694] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:27,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963022616] [2022-11-16 11:25:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:27,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:27,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:27,280 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:27,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:25:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:25:27,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-16 11:25:27,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:25:27,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963022616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:27,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:25:27,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2022-11-16 11:25:27,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667310106] [2022-11-16 11:25:27,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:27,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:25:27,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:27,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:25:27,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:25:27,656 INFO L87 Difference]: Start difference. First operand 279 states and 356 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 11:25:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:28,110 INFO L93 Difference]: Finished difference Result 496 states and 656 transitions. [2022-11-16 11:25:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:25:28,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 120 [2022-11-16 11:25:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:28,113 INFO L225 Difference]: With dead ends: 496 [2022-11-16 11:25:28,113 INFO L226 Difference]: Without dead ends: 297 [2022-11-16 11:25:28,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:25:28,117 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 253 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:28,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 850 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:25:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-11-16 11:25:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 282. [2022-11-16 11:25:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 188 states have (on average 1.1702127659574468) internal successors, (220), 194 states have internal predecessors, (220), 63 states have call successors, (63), 27 states have call predecessors, (63), 30 states have return successors, (77), 60 states have call predecessors, (77), 62 states have call successors, (77) [2022-11-16 11:25:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 360 transitions. [2022-11-16 11:25:28,151 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 360 transitions. Word has length 120 [2022-11-16 11:25:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:28,151 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 360 transitions. [2022-11-16 11:25:28,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-16 11:25:28,152 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 360 transitions. [2022-11-16 11:25:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-16 11:25:28,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:28,154 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:28,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:28,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 11:25:28,361 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:28,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:28,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1914003673, now seen corresponding path program 1 times [2022-11-16 11:25:28,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:28,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827619709] [2022-11-16 11:25:28,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:28,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:25:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:25:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:25:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 11:25:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 11:25:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-16 11:25:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2022-11-16 11:25:28,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:28,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827619709] [2022-11-16 11:25:28,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827619709] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:28,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436065232] [2022-11-16 11:25:28,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:28,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:28,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:28,775 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:28,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:25:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:29,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:25:29,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-16 11:25:29,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:25:29,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436065232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:29,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:25:29,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-16 11:25:29,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505878646] [2022-11-16 11:25:29,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:29,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:25:29,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:29,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:25:29,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:25:29,042 INFO L87 Difference]: Start difference. First operand 282 states and 360 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:25:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:29,086 INFO L93 Difference]: Finished difference Result 495 states and 656 transitions. [2022-11-16 11:25:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:25:29,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2022-11-16 11:25:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:29,090 INFO L225 Difference]: With dead ends: 495 [2022-11-16 11:25:29,090 INFO L226 Difference]: Without dead ends: 293 [2022-11-16 11:25:29,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:25:29,092 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:29,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 352 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:25:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-16 11:25:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2022-11-16 11:25:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 191 states have (on average 1.1675392670157068) internal successors, (223), 198 states have internal predecessors, (223), 64 states have call successors, (64), 27 states have call predecessors, (64), 31 states have return successors, (84), 61 states have call predecessors, (84), 63 states have call successors, (84) [2022-11-16 11:25:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 371 transitions. [2022-11-16 11:25:29,124 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 371 transitions. Word has length 121 [2022-11-16 11:25:29,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:29,124 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 371 transitions. [2022-11-16 11:25:29,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:25:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 371 transitions. [2022-11-16 11:25:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-16 11:25:29,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:29,127 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:29,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:29,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:29,334 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:29,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:29,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1662855644, now seen corresponding path program 1 times [2022-11-16 11:25:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:29,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495200733] [2022-11-16 11:25:29,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:29,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:29,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:29,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:29,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:29,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:29,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:29,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:29,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:29,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:29,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:29,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:25:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 11:25:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:30,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 11:25:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:30,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 11:25:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:30,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 11:25:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:30,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-16 11:25:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:30,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:25:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-16 11:25:30,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:30,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495200733] [2022-11-16 11:25:30,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495200733] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:30,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813254905] [2022-11-16 11:25:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:30,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:30,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:30,090 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:30,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:25:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:30,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 11:25:30,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:30,414 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:25:30,414 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:25:30,432 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:25:30,432 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:25:32,656 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2022-11-16 11:25:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 105 proven. 17 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-16 11:25:34,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:25:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-11-16 11:25:34,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813254905] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:25:34,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:25:34,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 12] total 32 [2022-11-16 11:25:34,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007433884] [2022-11-16 11:25:34,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:34,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-16 11:25:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:34,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-16 11:25:34,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=834, Unknown=1, NotChecked=58, Total=992 [2022-11-16 11:25:34,869 INFO L87 Difference]: Start difference. First operand 287 states and 371 transitions. Second operand has 32 states, 32 states have (on average 4.125) internal successors, (132), 30 states have internal predecessors, (132), 12 states have call successors, (38), 4 states have call predecessors, (38), 7 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) [2022-11-16 11:25:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:37,661 INFO L93 Difference]: Finished difference Result 667 states and 955 transitions. [2022-11-16 11:25:37,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:25:37,662 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.125) internal successors, (132), 30 states have internal predecessors, (132), 12 states have call successors, (38), 4 states have call predecessors, (38), 7 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) Word has length 131 [2022-11-16 11:25:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:37,667 INFO L225 Difference]: With dead ends: 667 [2022-11-16 11:25:37,668 INFO L226 Difference]: Without dead ends: 449 [2022-11-16 11:25:37,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 273 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=285, Invalid=2268, Unknown=1, NotChecked=98, Total=2652 [2022-11-16 11:25:37,670 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 248 mSDsluCounter, 3324 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 973 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:37,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 3598 Invalid, 3107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1894 Invalid, 0 Unknown, 973 Unchecked, 1.8s Time] [2022-11-16 11:25:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-11-16 11:25:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 330. [2022-11-16 11:25:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 221 states have (on average 1.1493212669683257) internal successors, (254), 229 states have internal predecessors, (254), 71 states have call successors, (71), 32 states have call predecessors, (71), 37 states have return successors, (113), 68 states have call predecessors, (113), 70 states have call successors, (113) [2022-11-16 11:25:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 438 transitions. [2022-11-16 11:25:37,718 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 438 transitions. Word has length 131 [2022-11-16 11:25:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:37,718 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 438 transitions. [2022-11-16 11:25:37,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.125) internal successors, (132), 30 states have internal predecessors, (132), 12 states have call successors, (38), 4 states have call predecessors, (38), 7 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) [2022-11-16 11:25:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 438 transitions. [2022-11-16 11:25:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-16 11:25:37,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:37,722 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:37,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:37,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:37,934 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:37,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:37,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1363735611, now seen corresponding path program 1 times [2022-11-16 11:25:37,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:37,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121107069] [2022-11-16 11:25:37,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:37,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:25:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 11:25:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 11:25:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 11:25:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 11:25:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 11:25:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 11:25:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-11-16 11:25:38,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:38,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121107069] [2022-11-16 11:25:38,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121107069] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:38,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989845926] [2022-11-16 11:25:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:38,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:38,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:38,366 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:38,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:25:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 11:25:38,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-16 11:25:38,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:25:38,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989845926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:38,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:25:38,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 14 [2022-11-16 11:25:38,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782978675] [2022-11-16 11:25:38,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:38,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:25:38,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:38,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:25:38,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:25:38,872 INFO L87 Difference]: Start difference. First operand 330 states and 438 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-16 11:25:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:39,484 INFO L93 Difference]: Finished difference Result 545 states and 729 transitions. [2022-11-16 11:25:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:25:39,485 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 129 [2022-11-16 11:25:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:39,487 INFO L225 Difference]: With dead ends: 545 [2022-11-16 11:25:39,487 INFO L226 Difference]: Without dead ends: 302 [2022-11-16 11:25:39,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-11-16 11:25:39,489 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 181 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:39,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1274 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:25:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-16 11:25:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2022-11-16 11:25:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 203 states have (on average 1.1379310344827587) internal successors, (231), 209 states have internal predecessors, (231), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (97), 61 states have call predecessors, (97), 63 states have call successors, (97) [2022-11-16 11:25:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 392 transitions. [2022-11-16 11:25:39,535 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 392 transitions. Word has length 129 [2022-11-16 11:25:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:39,535 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 392 transitions. [2022-11-16 11:25:39,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-16 11:25:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 392 transitions. [2022-11-16 11:25:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-16 11:25:39,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:39,539 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:39,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:39,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 11:25:39,746 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:39,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:39,746 INFO L85 PathProgramCache]: Analyzing trace with hash 369986644, now seen corresponding path program 1 times [2022-11-16 11:25:39,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:39,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389367336] [2022-11-16 11:25:39,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:39,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:25:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:25:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:25:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 11:25:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 11:25:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-16 11:25:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-16 11:25:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-11-16 11:25:40,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:40,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389367336] [2022-11-16 11:25:40,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389367336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:40,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472864027] [2022-11-16 11:25:40,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:40,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:40,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:40,707 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:40,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:25:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 11:25:40,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:41,041 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:25:41,041 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:25:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 103 proven. 21 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-16 11:25:42,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:25:42,799 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 121 treesize of output 113 [2022-11-16 11:25:42,806 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 113 treesize of output 105 [2022-11-16 11:25:42,810 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 105 treesize of output 101 [2022-11-16 11:25:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-16 11:25:42,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472864027] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:25:42,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:25:42,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 16] total 35 [2022-11-16 11:25:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287286494] [2022-11-16 11:25:42,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:42,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-16 11:25:42,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:42,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-16 11:25:42,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2022-11-16 11:25:42,880 INFO L87 Difference]: Start difference. First operand 300 states and 392 transitions. Second operand has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 33 states have internal predecessors, (139), 16 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 16 states have call predecessors, (39), 16 states have call successors, (39) [2022-11-16 11:25:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:45,412 INFO L93 Difference]: Finished difference Result 527 states and 758 transitions. [2022-11-16 11:25:45,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-16 11:25:45,413 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 33 states have internal predecessors, (139), 16 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 16 states have call predecessors, (39), 16 states have call successors, (39) Word has length 132 [2022-11-16 11:25:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:45,417 INFO L225 Difference]: With dead ends: 527 [2022-11-16 11:25:45,417 INFO L226 Difference]: Without dead ends: 376 [2022-11-16 11:25:45,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 273 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=293, Invalid=2359, Unknown=0, NotChecked=0, Total=2652 [2022-11-16 11:25:45,420 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 275 mSDsluCounter, 3113 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 3342 SdHoareTripleChecker+Invalid, 2274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:45,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 3342 Invalid, 2274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1908 Invalid, 0 Unknown, 202 Unchecked, 1.9s Time] [2022-11-16 11:25:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-11-16 11:25:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 312. [2022-11-16 11:25:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 211 states have (on average 1.1374407582938388) internal successors, (240), 218 states have internal predecessors, (240), 66 states have call successors, (66), 30 states have call predecessors, (66), 34 states have return successors, (113), 63 states have call predecessors, (113), 65 states have call successors, (113) [2022-11-16 11:25:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 419 transitions. [2022-11-16 11:25:45,475 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 419 transitions. Word has length 132 [2022-11-16 11:25:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:45,476 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 419 transitions. [2022-11-16 11:25:45,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 33 states have internal predecessors, (139), 16 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 16 states have call predecessors, (39), 16 states have call successors, (39) [2022-11-16 11:25:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 419 transitions. [2022-11-16 11:25:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-16 11:25:45,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:45,479 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:25:45,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:45,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 11:25:45,685 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:45,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:45,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1187163488, now seen corresponding path program 1 times [2022-11-16 11:25:45,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:45,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451867564] [2022-11-16 11:25:45,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:45,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:25:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:25:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:25:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 11:25:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:46,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-16 11:25:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:46,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:46,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-16 11:25:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:46,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-16 11:25:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2022-11-16 11:25:46,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:46,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451867564] [2022-11-16 11:25:46,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451867564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:46,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690832003] [2022-11-16 11:25:46,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:46,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:46,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:46,060 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:46,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 11:25:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:46,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-16 11:25:46,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:46,414 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:25:46,415 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:25:46,431 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:25:46,431 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:25:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 109 proven. 15 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-16 11:25:48,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:25:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-16 11:25:49,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690832003] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:25:49,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:25:49,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19, 13] total 34 [2022-11-16 11:25:49,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884154721] [2022-11-16 11:25:49,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:49,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 11:25:49,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:49,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 11:25:49,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 11:25:49,776 INFO L87 Difference]: Start difference. First operand 312 states and 419 transitions. Second operand has 34 states, 33 states have (on average 4.363636363636363) internal successors, (144), 31 states have internal predecessors, (144), 13 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2022-11-16 11:25:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:52,710 INFO L93 Difference]: Finished difference Result 602 states and 863 transitions. [2022-11-16 11:25:52,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 11:25:52,711 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.363636363636363) internal successors, (144), 31 states have internal predecessors, (144), 13 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) Word has length 132 [2022-11-16 11:25:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:52,714 INFO L225 Difference]: With dead ends: 602 [2022-11-16 11:25:52,714 INFO L226 Difference]: Without dead ends: 403 [2022-11-16 11:25:52,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 265 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=293, Invalid=2359, Unknown=0, NotChecked=0, Total=2652 [2022-11-16 11:25:52,717 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 186 mSDsluCounter, 3124 mSDsCounter, 0 mSdLazyCounter, 1895 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 3343 SdHoareTripleChecker+Invalid, 2437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:52,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 3343 Invalid, 2437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1895 Invalid, 0 Unknown, 398 Unchecked, 2.0s Time] [2022-11-16 11:25:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-11-16 11:25:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 339. [2022-11-16 11:25:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 233 states have (on average 1.1416309012875536) internal successors, (266), 240 states have internal predecessors, (266), 67 states have call successors, (67), 34 states have call predecessors, (67), 38 states have return successors, (120), 64 states have call predecessors, (120), 66 states have call successors, (120) [2022-11-16 11:25:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 453 transitions. [2022-11-16 11:25:52,770 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 453 transitions. Word has length 132 [2022-11-16 11:25:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:52,770 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 453 transitions. [2022-11-16 11:25:52,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.363636363636363) internal successors, (144), 31 states have internal predecessors, (144), 13 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2022-11-16 11:25:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 453 transitions. [2022-11-16 11:25:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-16 11:25:52,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:52,774 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:52,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-16 11:25:52,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:25:52,980 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:52,980 INFO L85 PathProgramCache]: Analyzing trace with hash 800652698, now seen corresponding path program 1 times [2022-11-16 11:25:52,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:52,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312107472] [2022-11-16 11:25:52,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:52,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:25:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:25:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:25:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:25:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 11:25:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-16 11:25:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 11:25:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-11-16 11:25:53,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:53,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312107472] [2022-11-16 11:25:53,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312107472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:53,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020127918] [2022-11-16 11:25:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:53,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:53,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:53,578 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:53,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 11:25:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:53,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 11:25:53,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-16 11:25:54,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:25:54,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020127918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:54,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:25:54,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-11-16 11:25:54,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55827206] [2022-11-16 11:25:54,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:54,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:25:54,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:54,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:25:54,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:25:54,024 INFO L87 Difference]: Start difference. First operand 339 states and 453 transitions. Second operand has 9 states, 8 states have (on average 9.25) internal successors, (74), 9 states have internal predecessors, (74), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-16 11:25:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:54,423 INFO L93 Difference]: Finished difference Result 555 states and 742 transitions. [2022-11-16 11:25:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:25:54,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 9 states have internal predecessors, (74), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) Word has length 134 [2022-11-16 11:25:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:54,426 INFO L225 Difference]: With dead ends: 555 [2022-11-16 11:25:54,426 INFO L226 Difference]: Without dead ends: 336 [2022-11-16 11:25:54,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:25:54,428 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 229 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:54,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 836 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:25:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-11-16 11:25:54,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2022-11-16 11:25:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 231 states have (on average 1.1385281385281385) internal successors, (263), 237 states have internal predecessors, (263), 67 states have call successors, (67), 34 states have call predecessors, (67), 37 states have return successors, (114), 64 states have call predecessors, (114), 66 states have call successors, (114) [2022-11-16 11:25:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 444 transitions. [2022-11-16 11:25:54,477 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 444 transitions. Word has length 134 [2022-11-16 11:25:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:54,477 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 444 transitions. [2022-11-16 11:25:54,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 9 states have internal predecessors, (74), 5 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 5 states have call successors, (16) [2022-11-16 11:25:54,478 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 444 transitions. [2022-11-16 11:25:54,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-16 11:25:54,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:54,480 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:25:54,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:54,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 11:25:54,687 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:54,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash 315027163, now seen corresponding path program 1 times [2022-11-16 11:25:54,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:54,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753888776] [2022-11-16 11:25:54,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:54,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:54,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:54,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:54,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:54,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:54,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:54,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:54,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:54,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:54,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:54,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:25:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:25:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:25:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:55,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:25:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:55,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-16 11:25:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:55,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 11:25:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:55,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:55,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 11:25:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:55,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 11:25:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-16 11:25:55,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:55,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753888776] [2022-11-16 11:25:55,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753888776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:55,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409361598] [2022-11-16 11:25:55,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:55,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:55,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:55,079 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:55,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 11:25:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:55,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 11:25:55,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 121 proven. 3 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-16 11:25:55,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:25:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-16 11:25:55,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409361598] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:25:55,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:25:55,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 7] total 18 [2022-11-16 11:25:55,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821195145] [2022-11-16 11:25:55,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:55,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:25:55,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:55,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:25:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:25:55,784 INFO L87 Difference]: Start difference. First operand 336 states and 444 transitions. Second operand has 18 states, 15 states have (on average 5.6) internal successors, (84), 14 states have internal predecessors, (84), 5 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) [2022-11-16 11:25:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:56,153 INFO L93 Difference]: Finished difference Result 551 states and 729 transitions. [2022-11-16 11:25:56,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:25:56,153 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.6) internal successors, (84), 14 states have internal predecessors, (84), 5 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) Word has length 145 [2022-11-16 11:25:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:56,156 INFO L225 Difference]: With dead ends: 551 [2022-11-16 11:25:56,156 INFO L226 Difference]: Without dead ends: 338 [2022-11-16 11:25:56,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-11-16 11:25:56,158 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 12 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:56,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2264 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:25:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-16 11:25:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 331. [2022-11-16 11:25:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 228 states have (on average 1.1403508771929824) internal successors, (260), 232 states have internal predecessors, (260), 67 states have call successors, (67), 34 states have call predecessors, (67), 35 states have return successors, (98), 64 states have call predecessors, (98), 66 states have call successors, (98) [2022-11-16 11:25:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 425 transitions. [2022-11-16 11:25:56,221 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 425 transitions. Word has length 145 [2022-11-16 11:25:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:56,221 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 425 transitions. [2022-11-16 11:25:56,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.6) internal successors, (84), 14 states have internal predecessors, (84), 5 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) [2022-11-16 11:25:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 425 transitions. [2022-11-16 11:25:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-16 11:25:56,223 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:56,224 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-16 11:25:56,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:56,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 11:25:56,430 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:56,430 INFO L85 PathProgramCache]: Analyzing trace with hash 900691480, now seen corresponding path program 1 times [2022-11-16 11:25:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:56,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041547192] [2022-11-16 11:25:56,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:56,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:57,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:25:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:57,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:25:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:57,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:25:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:57,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:57,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-16 11:25:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:57,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:25:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:57,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:25:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:57,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-16 11:25:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:58,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:25:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:58,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-16 11:25:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:58,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-16 11:25:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:58,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:25:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:58,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-16 11:25:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:58,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-16 11:25:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:58,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:25:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:58,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 11:25:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:58,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:25:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-16 11:25:58,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:58,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041547192] [2022-11-16 11:25:58,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041547192] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:58,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677873976] [2022-11-16 11:25:58,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:58,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:58,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:58,338 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:58,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 11:25:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:58,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-16 11:25:58,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:58,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-16 11:25:58,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:25:58,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:26:00,424 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 9 treesize of output 5 [2022-11-16 11:26:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 127 proven. 33 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-16 11:26:02,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:26:03,796 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 64 treesize of output 60 [2022-11-16 11:26:03,799 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 6 [2022-11-16 11:26:03,804 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 6 [2022-11-16 11:26:03,811 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 6 [2022-11-16 11:26:03,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:26:03,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 233 [2022-11-16 11:26:03,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:26:03,841 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 269 treesize of output 257 [2022-11-16 11:26:03,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:26:03,851 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 257 treesize of output 251 [2022-11-16 11:26:03,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:26:03,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 101 treesize of output 89 [2022-11-16 11:26:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 10 proven. 35 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-11-16 11:26:04,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677873976] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:26:04,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:26:04,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 18] total 51 [2022-11-16 11:26:04,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961998626] [2022-11-16 11:26:04,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:26:04,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-16 11:26:04,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:26:04,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-16 11:26:04,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2365, Unknown=0, NotChecked=0, Total=2550 [2022-11-16 11:26:04,220 INFO L87 Difference]: Start difference. First operand 331 states and 425 transitions. Second operand has 51 states, 50 states have (on average 3.86) internal successors, (193), 46 states have internal predecessors, (193), 21 states have call successors, (49), 4 states have call predecessors, (49), 10 states have return successors, (48), 22 states have call predecessors, (48), 21 states have call successors, (48) [2022-11-16 11:26:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:26:11,139 INFO L93 Difference]: Finished difference Result 725 states and 953 transitions. [2022-11-16 11:26:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-16 11:26:11,140 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.86) internal successors, (193), 46 states have internal predecessors, (193), 21 states have call successors, (49), 4 states have call predecessors, (49), 10 states have return successors, (48), 22 states have call predecessors, (48), 21 states have call successors, (48) Word has length 148 [2022-11-16 11:26:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:26:11,143 INFO L225 Difference]: With dead ends: 725 [2022-11-16 11:26:11,143 INFO L226 Difference]: Without dead ends: 548 [2022-11-16 11:26:11,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 287 SyntacticMatches, 18 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2928 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=650, Invalid=9250, Unknown=0, NotChecked=0, Total=9900 [2022-11-16 11:26:11,148 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 714 mSDsluCounter, 3917 mSDsCounter, 0 mSdLazyCounter, 3333 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 4109 SdHoareTripleChecker+Invalid, 4200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 3333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 484 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:26:11,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 4109 Invalid, 4200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 3333 Invalid, 0 Unknown, 484 Unchecked, 3.4s Time] [2022-11-16 11:26:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-11-16 11:26:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 508. [2022-11-16 11:26:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 352 states have (on average 1.1590909090909092) internal successors, (408), 363 states have internal predecessors, (408), 100 states have call successors, (100), 48 states have call predecessors, (100), 55 states have return successors, (142), 96 states have call predecessors, (142), 98 states have call successors, (142) [2022-11-16 11:26:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 650 transitions. [2022-11-16 11:26:11,262 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 650 transitions. Word has length 148 [2022-11-16 11:26:11,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:26:11,263 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 650 transitions. [2022-11-16 11:26:11,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.86) internal successors, (193), 46 states have internal predecessors, (193), 21 states have call successors, (49), 4 states have call predecessors, (49), 10 states have return successors, (48), 22 states have call predecessors, (48), 21 states have call successors, (48) [2022-11-16 11:26:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 650 transitions. [2022-11-16 11:26:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-11-16 11:26:11,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:26:11,268 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:26:11,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:26:11,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:26:11,484 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:26:11,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:26:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1039782523, now seen corresponding path program 1 times [2022-11-16 11:26:11,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:26:11,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358145578] [2022-11-16 11:26:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:26:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:26:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:26:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:26:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:26:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 11:26:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:26:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:26:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:11,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:26:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:26:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:26:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:26:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 11:26:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:26:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 11:26:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-16 11:26:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-16 11:26:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 11:26:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2022-11-16 11:26:12,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:26:12,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358145578] [2022-11-16 11:26:12,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358145578] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:26:12,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209952332] [2022-11-16 11:26:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:26:12,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:26:12,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:26:12,243 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:26:12,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 11:26:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:12,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 11:26:12,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:26:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-16 11:26:12,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:26:12,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209952332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:26:12,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:26:12,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 13 [2022-11-16 11:26:12,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745570108] [2022-11-16 11:26:12,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:26:12,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:26:12,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:26:12,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:26:12,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:26:12,896 INFO L87 Difference]: Start difference. First operand 508 states and 650 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-16 11:26:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:26:13,243 INFO L93 Difference]: Finished difference Result 934 states and 1222 transitions. [2022-11-16 11:26:13,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:26:13,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2022-11-16 11:26:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:26:13,247 INFO L225 Difference]: With dead ends: 934 [2022-11-16 11:26:13,248 INFO L226 Difference]: Without dead ends: 550 [2022-11-16 11:26:13,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:26:13,250 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 20 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:26:13,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1189 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 112 Unchecked, 0.1s Time] [2022-11-16 11:26:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-16 11:26:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 522. [2022-11-16 11:26:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 364 states have (on average 1.1620879120879122) internal successors, (423), 375 states have internal predecessors, (423), 100 states have call successors, (100), 48 states have call predecessors, (100), 57 states have return successors, (146), 98 states have call predecessors, (146), 98 states have call successors, (146) [2022-11-16 11:26:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 669 transitions. [2022-11-16 11:26:13,336 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 669 transitions. Word has length 160 [2022-11-16 11:26:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:26:13,336 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 669 transitions. [2022-11-16 11:26:13,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-16 11:26:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 669 transitions. [2022-11-16 11:26:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-11-16 11:26:13,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:26:13,339 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:26:13,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 11:26:13,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 11:26:13,546 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:26:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:26:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash 526975427, now seen corresponding path program 1 times [2022-11-16 11:26:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:26:13,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128601551] [2022-11-16 11:26:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:26:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:26:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:26:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:26:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:26:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 11:26:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:26:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:26:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:26:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:26:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:26:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:26:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-16 11:26:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:26:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:13,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 11:26:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:14,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-16 11:26:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:14,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:26:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:14,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-16 11:26:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:14,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 11:26:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-11-16 11:26:14,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:26:14,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128601551] [2022-11-16 11:26:14,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128601551] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:26:14,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655427384] [2022-11-16 11:26:14,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:26:14,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:26:14,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:26:14,049 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:26:14,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 11:26:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:26:14,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-16 11:26:14,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:26:14,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:26:14,599 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:26:14,614 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:26:14,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 11:26:14,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:26:14,635 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:26:14,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:26:14,725 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-16 11:26:14,725 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 65 treesize of output 93 [2022-11-16 11:26:14,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:26:14,731 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 79 treesize of output 67 [2022-11-16 11:26:14,738 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:26:14,819 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|))) (let ((.cse0 (select .cse1 0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_22) .cse0 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_22) .cse0)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|)) (= (select .cse1 24) (select v_DerPreprocessor_22 24)))))) is different from true [2022-11-16 11:26:14,981 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|)) (= (select .cse1 24) (select v_DerPreprocessor_24 24)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_23) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_24) .cse0 v_DerPreprocessor_23) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_24) .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56|))) (let ((.cse3 (select .cse2 0))) (and (= (select .cse2 24) (select v_DerPreprocessor_22 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| v_DerPreprocessor_22) .cse3 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| v_DerPreprocessor_22) .cse3) (select |c_#memory_$Pointer$.base| .cse3)) (not (= .cse3 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56|))))))) is different from true [2022-11-16 11:26:15,370 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|)) (= (select .cse1 24) (select v_DerPreprocessor_24 24)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_23) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_24) .cse0 v_DerPreprocessor_23) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_24) .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56|)) (= (select .cse3 24) (select v_DerPreprocessor_26 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_25) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| v_DerPreprocessor_26) .cse2 v_DerPreprocessor_25) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| v_DerPreprocessor_26) .cse2) (select |c_#memory_$Pointer$.base| .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse5 (select .cse4 0))) (and (= (select v_DerPreprocessor_28 24) (select .cse4 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| .cse5)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_27) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_28) .cse5 v_DerPreprocessor_27) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_28) .cse5) (select |c_#memory_$Pointer$.base| .cse5)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56|))) (let ((.cse7 (select .cse6 0))) (and (= (select .cse6 24) (select v_DerPreprocessor_22 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| v_DerPreprocessor_22) .cse7 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| v_DerPreprocessor_22) .cse7) (select |c_#memory_$Pointer$.base| .cse7)) (not (= .cse7 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56|))))))) is different from true [2022-11-16 11:26:15,887 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| Int) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56|))) (let ((.cse0 (select .cse1 0))) (and (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56|)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_30) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| v_DerPreprocessor_29) .cse0 v_DerPreprocessor_30) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| v_DerPreprocessor_29) .cse0)) (= (select .cse1 24) (select v_DerPreprocessor_29 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|)) (= (select .cse3 24) (select v_DerPreprocessor_24 24)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_23) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_24) .cse2 v_DerPreprocessor_23) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_24) .cse2)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57|))) (let ((.cse4 (select .cse5 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| .cse4)) (= (select .cse5 24) (select v_DerPreprocessor_26 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_25) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| v_DerPreprocessor_26) .cse4 v_DerPreprocessor_25) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| v_DerPreprocessor_26) .cse4) (select |c_#memory_$Pointer$.base| .cse4)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse7 (select .cse6 0))) (and (= (select v_DerPreprocessor_28 24) (select .cse6 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| .cse7)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_27) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_28) .cse7 v_DerPreprocessor_27) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_28) .cse7) (select |c_#memory_$Pointer$.base| .cse7)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56|))) (let ((.cse9 (select .cse8 0))) (and (= (select .cse8 24) (select v_DerPreprocessor_22 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse9 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| v_DerPreprocessor_22) .cse9 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| v_DerPreprocessor_22) .cse9) (select |c_#memory_$Pointer$.base| .cse9)) (not (= .cse9 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56|))))))) is different from true [2022-11-16 11:26:16,447 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59| Int) (v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59|))) (let ((.cse0 (select .cse1 0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_30) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59| v_DerPreprocessor_29) .cse0 v_DerPreprocessor_30) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59| v_DerPreprocessor_29) .cse0)) (= (select v_DerPreprocessor_29 24) (select .cse1 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59| .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|))) (let ((.cse2 (select .cse3 0))) (and (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|)) (= (select .cse3 24) (select v_DerPreprocessor_24 24)) (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_23) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_24) .cse2 v_DerPreprocessor_23) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_24) .cse2)))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57|))) (let ((.cse4 (select .cse5 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| .cse4)) (= (select .cse5 24) (select v_DerPreprocessor_31 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_32) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| v_DerPreprocessor_31) .cse4 v_DerPreprocessor_32) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| v_DerPreprocessor_31) .cse4) (select |c_#memory_$Pointer$.base| .cse4)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58|))) (let ((.cse6 (select .cse7 0))) (and (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_34) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58| v_DerPreprocessor_33) .cse6 v_DerPreprocessor_34) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58| v_DerPreprocessor_33) .cse6)) (= (select v_DerPreprocessor_33 24) (select .cse7 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58| .cse6)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56|))) (let ((.cse8 (select .cse9 0))) (and (not (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56|)) (= (select .cse9 24) (select v_DerPreprocessor_26 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_25) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| v_DerPreprocessor_26) .cse8 v_DerPreprocessor_25) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| v_DerPreprocessor_26) .cse8) (select |c_#memory_$Pointer$.base| .cse8)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse11 (select .cse10 0))) (and (= (select v_DerPreprocessor_28 24) (select .cse10 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| .cse11)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_27) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_28) .cse11 v_DerPreprocessor_27) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_28) .cse11) (select |c_#memory_$Pointer$.base| .cse11)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse12 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56|))) (let ((.cse13 (select .cse12 0))) (and (= (select .cse12 24) (select v_DerPreprocessor_22 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| v_DerPreprocessor_22) .cse13 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| v_DerPreprocessor_22) .cse13) (select |c_#memory_$Pointer$.base| .cse13)) (not (= .cse13 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56|))))))) is different from true [2022-11-16 11:26:19,036 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59| Int) (v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59|))) (let ((.cse0 (select .cse1 0))) (and (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_30) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59| v_DerPreprocessor_29) .cse0 v_DerPreprocessor_30) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59| v_DerPreprocessor_29) .cse0)) (= (select v_DerPreprocessor_29 24) (select .cse1 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59| .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| Int) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56|))) (let ((.cse2 (select .cse3 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_36) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| v_DerPreprocessor_35) .cse2 v_DerPreprocessor_36) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| v_DerPreprocessor_35) .cse2) (select |c_#memory_$Pointer$.base| .cse2)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56|)) (= (select v_DerPreprocessor_35 24) (select .cse3 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|))) (let ((.cse4 (select .cse5 0))) (and (not (= .cse4 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|)) (= (select .cse5 24) (select v_DerPreprocessor_24 24)) (= (select |c_#memory_$Pointer$.base| .cse4) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_23) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_24) .cse4 v_DerPreprocessor_23) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_24) .cse4)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_61| Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_61|))) (let ((.cse6 (select .cse7 0))) (and (= (select |c_#memory_$Pointer$.base| .cse6) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_38) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_61| v_DerPreprocessor_37) .cse6 v_DerPreprocessor_38) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_61| v_DerPreprocessor_37) .cse6)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_61| .cse6)) (= (select v_DerPreprocessor_37 24) (select .cse7 24)))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57|))) (let ((.cse8 (select .cse9 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| .cse8)) (= (select .cse9 24) (select v_DerPreprocessor_31 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_32) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| v_DerPreprocessor_31) .cse8 v_DerPreprocessor_32) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| v_DerPreprocessor_31) .cse8) (select |c_#memory_$Pointer$.base| .cse8)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58|))) (let ((.cse10 (select .cse11 0))) (and (= (select |c_#memory_$Pointer$.base| .cse10) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_34) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58| v_DerPreprocessor_33) .cse10 v_DerPreprocessor_34) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58| v_DerPreprocessor_33) .cse10)) (= (select v_DerPreprocessor_33 24) (select .cse11 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58| .cse10)))))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_62| Int) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse12 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_62|))) (let ((.cse13 (select .cse12 0))) (and (= (select v_DerPreprocessor_40 24) (select .cse12 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_62| .cse13)) (= (select |c_#memory_$Pointer$.base| .cse13) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_62| v_DerPreprocessor_40) .cse13 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_62| v_DerPreprocessor_40) .cse13)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse15 (select .cse14 0))) (and (= (select v_DerPreprocessor_28 24) (select .cse14 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| .cse15)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse15 v_DerPreprocessor_27) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_28) .cse15 v_DerPreprocessor_27) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_28) .cse15) (select |c_#memory_$Pointer$.base| .cse15)))))) (exists ((v_DerPreprocessor_26 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60| Int) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60|))) (let ((.cse16 (select .cse17 0))) (and (= (select |c_#memory_$Pointer$.base| .cse16) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_25) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60| v_DerPreprocessor_26) .cse16 v_DerPreprocessor_25) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60| v_DerPreprocessor_26) .cse16)) (= (select .cse17 24) (select v_DerPreprocessor_26 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60| .cse16)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse18 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56|))) (let ((.cse19 (select .cse18 0))) (and (= (select .cse18 24) (select v_DerPreprocessor_22 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse19 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| v_DerPreprocessor_22) .cse19 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| v_DerPreprocessor_22) .cse19) (select |c_#memory_$Pointer$.base| .cse19)) (not (= .cse19 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56|))))))) is different from true [2022-11-16 11:26:34,500 WARN L233 SmtUtils]: Spent 10.55s on a formula simplification that was a NOOP. DAG size: 272 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:26:34,631 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63|))) (let ((.cse0 (select .cse1 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| .cse0)) (= (select |c_#memory_$Pointer$.base| .cse0) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| v_DerPreprocessor_41) .cse0 v_DerPreprocessor_42) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_63| v_DerPreprocessor_41) .cse0)) (= (select .cse1 24) (select v_DerPreprocessor_41 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59| Int) (v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59|))) (let ((.cse2 (select .cse3 0))) (and (= (select |c_#memory_$Pointer$.base| .cse2) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_30) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59| v_DerPreprocessor_29) .cse2 v_DerPreprocessor_30) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59| v_DerPreprocessor_29) .cse2)) (= (select v_DerPreprocessor_29 24) (select .cse3 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_59| .cse2)))))) (exists ((v_DerPreprocessor_43 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| Int) (v_DerPreprocessor_44 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64|))) (let ((.cse5 (select .cse4 0))) (and (= (select .cse4 24) (select v_DerPreprocessor_43 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| .cse5)) (= (select |c_#memory_$Pointer$.base| .cse5) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| v_DerPreprocessor_43) .cse5 v_DerPreprocessor_44) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_64| v_DerPreprocessor_43) .cse5)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| Int) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56|))) (let ((.cse6 (select .cse7 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_36) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| v_DerPreprocessor_35) .cse6 v_DerPreprocessor_36) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56| v_DerPreprocessor_35) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_56|)) (= (select v_DerPreprocessor_35 24) (select .cse7 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|))) (let ((.cse8 (select .cse9 0))) (and (not (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55|)) (= (select .cse9 24) (select v_DerPreprocessor_24 24)) (= (select |c_#memory_$Pointer$.base| .cse8) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse8 v_DerPreprocessor_23) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_24) .cse8 v_DerPreprocessor_23) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_55| v_DerPreprocessor_24) .cse8)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_61| Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int))) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_61|))) (let ((.cse10 (select .cse11 0))) (and (= (select |c_#memory_$Pointer$.base| .cse10) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_38) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_61| v_DerPreprocessor_37) .cse10 v_DerPreprocessor_38) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_61| v_DerPreprocessor_37) .cse10)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_61| .cse10)) (= (select v_DerPreprocessor_37 24) (select .cse11 24)))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| Int)) (let ((.cse13 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57|))) (let ((.cse12 (select .cse13 0))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| .cse12)) (= (select .cse13 24) (select v_DerPreprocessor_31 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse12 v_DerPreprocessor_32) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| v_DerPreprocessor_31) .cse12 v_DerPreprocessor_32) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_57| v_DerPreprocessor_31) .cse12) (select |c_#memory_$Pointer$.base| .cse12)))))) (exists ((v_DerPreprocessor_48 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60| Int) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse14 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60|))) (let ((.cse15 (select .cse14 0))) (and (= (select .cse14 24) (select v_DerPreprocessor_47 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse15 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60| v_DerPreprocessor_47) .cse15 v_DerPreprocessor_48) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60| v_DerPreprocessor_47) .cse15) (select |c_#memory_$Pointer$.base| .cse15)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_60| .cse15)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| Int) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse17 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|))) (let ((.cse16 (select .cse17 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse16 v_DerPreprocessor_25) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| v_DerPreprocessor_26) .cse16 v_DerPreprocessor_25) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58| v_DerPreprocessor_26) .cse16) (select |c_#memory_$Pointer$.base| .cse16)) (= (select v_DerPreprocessor_26 24) (select .cse17 24)) (not (= .cse16 |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_58|)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse19 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58|))) (let ((.cse18 (select .cse19 0))) (and (= (select |c_#memory_$Pointer$.base| .cse18) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse18 v_DerPreprocessor_34) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58| v_DerPreprocessor_33) .cse18 v_DerPreprocessor_34) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58| v_DerPreprocessor_33) .cse18)) (= (select v_DerPreprocessor_33 24) (select .cse19 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_58| .cse18)))))) (exists ((v_DerPreprocessor_40 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_62| Int) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse20 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_62|))) (let ((.cse21 (select .cse20 0))) (and (= (select v_DerPreprocessor_40 24) (select .cse20 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_62| .cse21)) (= (select |c_#memory_$Pointer$.base| .cse21) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse21 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_62| v_DerPreprocessor_40) .cse21 v_DerPreprocessor_39) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_62| v_DerPreprocessor_40) .cse21)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| Int) (v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse23 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65|))) (let ((.cse22 (select .cse23 0))) (and (= (select |c_#memory_$Pointer$.base| .cse22) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse22 v_DerPreprocessor_45) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| v_DerPreprocessor_46) .cse22 v_DerPreprocessor_45) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| v_DerPreprocessor_46) .cse22)) (= (select .cse23 24) (select v_DerPreprocessor_46 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_65| .cse22)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| Int) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (let ((.cse24 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57|))) (let ((.cse25 (select .cse24 0))) (and (= (select v_DerPreprocessor_28 24) (select .cse24 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| .cse25)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse25 v_DerPreprocessor_27) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_28) .cse25 v_DerPreprocessor_27) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_57| v_DerPreprocessor_28) .cse25) (select |c_#memory_$Pointer$.base| .cse25)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse26 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56|))) (let ((.cse27 (select .cse26 0))) (and (= (select .cse26 24) (select v_DerPreprocessor_22 24)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse27 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| v_DerPreprocessor_22) .cse27 v_DerPreprocessor_21) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56| v_DerPreprocessor_22) .cse27) (select |c_#memory_$Pointer$.base| .cse27)) (not (= .cse27 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_56|))))))) is different from true [2022-11-16 11:26:56,754 WARN L233 SmtUtils]: Spent 21.65s on a formula simplification that was a NOOP. DAG size: 276 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:27:20,153 WARN L233 SmtUtils]: Spent 21.96s on a formula simplification that was a NOOP. DAG size: 276 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:27:42,347 WARN L233 SmtUtils]: Spent 21.69s on a formula simplification that was a NOOP. DAG size: 278 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:28:04,190 WARN L233 SmtUtils]: Spent 20.95s on a formula simplification that was a NOOP. DAG size: 276 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:28:30,493 WARN L233 SmtUtils]: Spent 24.72s on a formula simplification that was a NOOP. DAG size: 278 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:28:54,665 WARN L233 SmtUtils]: Spent 23.48s on a formula simplification that was a NOOP. DAG size: 275 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:28:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 104 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 107 not checked. [2022-11-16 11:28:55,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:28:56,345 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1547 Int)) (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1546) |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_1545) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) v_ArrVal_1547)) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset|)))) is different from false [2022-11-16 11:28:56,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:28:56,366 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:28:56,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:28:56,391 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 309 treesize of output 287 [2022-11-16 11:28:56,400 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 306 treesize of output 298 [2022-11-16 11:28:56,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 298 treesize of output 294 [2022-11-16 11:28:56,503 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 24 treesize of output 22 [2022-11-16 11:28:56,515 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:28:56,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:28:56,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 65 treesize of output 63 [2022-11-16 11:28:57,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655427384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:28:57,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:28:57,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 28] total 34 [2022-11-16 11:28:57,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767287810] [2022-11-16 11:28:57,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:28:57,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 11:28:57,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:28:57,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 11:28:57,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1210, Unknown=28, NotChecked=616, Total=1980 [2022-11-16 11:28:57,072 INFO L87 Difference]: Start difference. First operand 522 states and 669 transitions. Second operand has 34 states, 28 states have (on average 5.821428571428571) internal successors, (163), 28 states have internal predecessors, (163), 16 states have call successors, (35), 10 states have call predecessors, (35), 13 states have return successors, (34), 15 states have call predecessors, (34), 16 states have call successors, (34) [2022-11-16 11:29:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:29:03,702 INFO L93 Difference]: Finished difference Result 938 states and 1242 transitions. [2022-11-16 11:29:03,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-16 11:29:03,703 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 5.821428571428571) internal successors, (163), 28 states have internal predecessors, (163), 16 states have call successors, (35), 10 states have call predecessors, (35), 13 states have return successors, (34), 15 states have call predecessors, (34), 16 states have call successors, (34) Word has length 160 [2022-11-16 11:29:03,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:29:03,707 INFO L225 Difference]: With dead ends: 938 [2022-11-16 11:29:03,708 INFO L226 Difference]: Without dead ends: 527 [2022-11-16 11:29:03,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 308 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 160.1s TimeCoverageRelationStatistics Valid=228, Invalid=3129, Unknown=97, NotChecked=968, Total=4422 [2022-11-16 11:29:03,712 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 79 mSDsluCounter, 4399 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 4664 SdHoareTripleChecker+Invalid, 4215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3756 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:29:03,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 4664 Invalid, 4215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 426 Invalid, 0 Unknown, 3756 Unchecked, 0.6s Time] [2022-11-16 11:29:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-11-16 11:29:03,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 471. [2022-11-16 11:29:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 336 states have (on average 1.1904761904761905) internal successors, (400), 342 states have internal predecessors, (400), 88 states have call successors, (88), 43 states have call predecessors, (88), 46 states have return successors, (109), 85 states have call predecessors, (109), 86 states have call successors, (109) [2022-11-16 11:29:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 597 transitions. [2022-11-16 11:29:03,782 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 597 transitions. Word has length 160 [2022-11-16 11:29:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:29:03,783 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 597 transitions. [2022-11-16 11:29:03,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 5.821428571428571) internal successors, (163), 28 states have internal predecessors, (163), 16 states have call successors, (35), 10 states have call predecessors, (35), 13 states have return successors, (34), 15 states have call predecessors, (34), 16 states have call successors, (34) [2022-11-16 11:29:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 597 transitions. [2022-11-16 11:29:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-16 11:29:03,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:29:03,785 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:29:03,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-16 11:29:03,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:29:03,992 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:29:03,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1137604397, now seen corresponding path program 1 times [2022-11-16 11:29:03,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:03,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933721680] [2022-11-16 11:29:03,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:03,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:29:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:29:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:29:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:29:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 11:29:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:29:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:29:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:29:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:29:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:29:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:29:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 11:29:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 11:29:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:29:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 11:29:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 11:29:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:29:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-16 11:29:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-16 11:29:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 45 proven. 28 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-11-16 11:29:05,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:05,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933721680] [2022-11-16 11:29:05,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933721680] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:29:05,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872417620] [2022-11-16 11:29:05,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:05,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:29:05,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:05,891 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:29:05,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 11:29:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:06,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-16 11:29:06,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:06,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:29:06,500 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:29:06,515 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:29:06,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-16 11:29:06,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:29:06,534 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:29:06,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:29:06,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:06,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2022-11-16 11:29:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 133 proven. 23 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-16 11:29:09,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:29:10,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:10,221 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 52 treesize of output 45 [2022-11-16 11:29:10,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:10,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-16 11:29:10,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:10,259 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 171 treesize of output 185 [2022-11-16 11:29:10,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:10,282 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 193 treesize of output 191 [2022-11-16 11:29:10,385 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:29:10,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:10,451 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 50 treesize of output 50 [2022-11-16 11:29:10,471 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2022-11-16 11:29:10,477 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 71 treesize of output 67 [2022-11-16 11:29:10,514 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:10,515 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 95 treesize of output 93 [2022-11-16 11:29:11,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872417620] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:29:11,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:29:11,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-11-16 11:29:11,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085592761] [2022-11-16 11:29:11,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:29:11,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 11:29:11,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:29:11,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 11:29:11,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1511, Unknown=0, NotChecked=0, Total=1640 [2022-11-16 11:29:11,253 INFO L87 Difference]: Start difference. First operand 471 states and 597 transitions. Second operand has 30 states, 26 states have (on average 5.884615384615385) internal successors, (153), 29 states have internal predecessors, (153), 15 states have call successors, (35), 4 states have call predecessors, (35), 8 states have return successors, (34), 12 states have call predecessors, (34), 15 states have call successors, (34) [2022-11-16 11:29:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:29:13,531 INFO L93 Difference]: Finished difference Result 884 states and 1125 transitions. [2022-11-16 11:29:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-16 11:29:13,532 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 5.884615384615385) internal successors, (153), 29 states have internal predecessors, (153), 15 states have call successors, (35), 4 states have call predecessors, (35), 8 states have return successors, (34), 12 states have call predecessors, (34), 15 states have call successors, (34) Word has length 161 [2022-11-16 11:29:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:29:13,536 INFO L225 Difference]: With dead ends: 884 [2022-11-16 11:29:13,536 INFO L226 Difference]: Without dead ends: 549 [2022-11-16 11:29:13,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 305 SyntacticMatches, 21 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=254, Invalid=2938, Unknown=0, NotChecked=0, Total=3192 [2022-11-16 11:29:13,539 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 151 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 2767 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:29:13,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 2767 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 954 Invalid, 0 Unknown, 454 Unchecked, 1.2s Time] [2022-11-16 11:29:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-11-16 11:29:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 523. [2022-11-16 11:29:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 381 states have (on average 1.178477690288714) internal successors, (449), 386 states have internal predecessors, (449), 90 states have call successors, (90), 48 states have call predecessors, (90), 51 states have return successors, (106), 88 states have call predecessors, (106), 88 states have call successors, (106) [2022-11-16 11:29:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 645 transitions. [2022-11-16 11:29:13,645 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 645 transitions. Word has length 161 [2022-11-16 11:29:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:29:13,646 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 645 transitions. [2022-11-16 11:29:13,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 5.884615384615385) internal successors, (153), 29 states have internal predecessors, (153), 15 states have call successors, (35), 4 states have call predecessors, (35), 8 states have return successors, (34), 12 states have call predecessors, (34), 15 states have call successors, (34) [2022-11-16 11:29:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 645 transitions. [2022-11-16 11:29:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-16 11:29:13,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:29:13,649 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:13,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-16 11:29:13,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:29:13,856 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:29:13,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:29:13,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2097411360, now seen corresponding path program 2 times [2022-11-16 11:29:13,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:29:13,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422562999] [2022-11-16 11:29:13,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:29:13,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:29:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:29:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:29:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-16 11:29:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:29:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 11:29:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:29:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:29:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-16 11:29:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 11:29:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:29:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:29:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 11:29:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:14,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-16 11:29:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:15,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:29:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:15,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:29:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:15,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-16 11:29:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:15,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-16 11:29:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:15,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:29:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:15,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-16 11:29:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:15,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-16 11:29:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:29:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-11-16 11:29:15,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:29:15,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422562999] [2022-11-16 11:29:15,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422562999] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:29:15,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266576872] [2022-11-16 11:29:15,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:29:15,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:29:15,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:29:15,191 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:29:15,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e39c0904-4a35-434c-a84b-8a57b5c85732/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 11:29:15,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:29:15,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:29:15,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-16 11:29:15,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:29:15,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:29:15,936 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:29:15,936 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 11 treesize of output 11 [2022-11-16 11:29:15,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 11:29:15,950 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:29:15,958 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:29:15,968 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:29:16,081 INFO L321 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2022-11-16 11:29:16,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 84 [2022-11-16 11:29:16,106 INFO L321 Elim1Store]: treesize reduction 52, result has 8.8 percent of original size [2022-11-16 11:29:16,107 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 3 case distinctions, treesize of input 90 treesize of output 94 [2022-11-16 11:29:16,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:16,119 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 70 treesize of output 64 [2022-11-16 11:29:16,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:16,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2022-11-16 11:29:16,139 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:29:16,146 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 12 treesize of output 11 [2022-11-16 11:29:16,156 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 35 treesize of output 28 [2022-11-16 11:29:16,163 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:29:16,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:29:16,174 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 16 treesize of output 20 [2022-11-16 11:29:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 124 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-16 11:29:19,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:29:20,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:20,346 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 118 treesize of output 95 [2022-11-16 11:29:20,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:20,358 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 110 treesize of output 103 [2022-11-16 11:29:20,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:20,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 6423 treesize of output 5434 [2022-11-16 11:29:20,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:20,660 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 9011 treesize of output 8829 [2022-11-16 11:29:20,741 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 9910 treesize of output 9774 [2022-11-16 11:29:20,907 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 9774 treesize of output 9706 [2022-11-16 11:29:21,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:21,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 11205 treesize of output 11118 [2022-11-16 11:29:21,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:29:21,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 11471 treesize of output 11502 [2022-11-16 11:37:42,686 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