./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS --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 bcbdd24aa3539f554995115754c17957131f4a70e9c01f3bd768b3e606eed4d4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 01:56:27,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:56:27,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:56:27,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:56:27,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:56:27,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:56:27,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:56:27,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:56:27,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:56:27,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:56:27,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:56:27,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:56:27,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:56:27,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:56:27,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:56:27,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:56:27,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:56:27,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:56:27,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:56:27,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:56:27,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:56:27,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:56:27,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:56:27,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:56:27,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:56:27,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:56:27,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:56:27,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:56:27,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:56:27,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:56:27,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:56:27,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:56:27,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:56:27,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:56:27,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:56:27,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:56:27,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:56:27,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:56:27,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:56:27,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:56:27,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:56:27,773 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-23 01:56:27,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:56:27,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:56:27,828 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:56:27,828 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:56:27,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 01:56:27,856 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 01:56:27,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:56:27,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:56:27,859 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:56:27,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:56:27,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:56:27,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:56:27,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 01:56:27,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 01:56:27,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 01:56:27,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 01:56:27,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:56:27,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 01:56:27,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:56:27,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:56:27,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 01:56:27,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:56:27,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:56:27,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 01:56:27,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 01:56:27,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 01:56:27,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 01:56:27,866 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 01:56:27,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 01:56:27,867 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 01:56:27,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 01:56:27,868 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/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_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS 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 -> bcbdd24aa3539f554995115754c17957131f4a70e9c01f3bd768b3e606eed4d4 [2022-11-23 01:56:28,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:56:28,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:56:28,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:56:28,263 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:56:28,263 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:56:28,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2022-11-23 01:56:31,802 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:56:32,399 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:56:32,399 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i [2022-11-23 01:56:32,459 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/data/a94521b6a/c847863306274f71ade116148fe5905d/FLAG4a28d2b6a [2022-11-23 01:56:32,480 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/data/a94521b6a/c847863306274f71ade116148fe5905d [2022-11-23 01:56:32,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:56:32,485 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:56:32,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:56:32,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:56:32,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:56:32,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:56:32" (1/1) ... [2022-11-23 01:56:32,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5407dcce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:32, skipping insertion in model container [2022-11-23 01:56:32,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:56:32" (1/1) ... [2022-11-23 01:56:32,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:56:32,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:56:32,984 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-11-23 01:56:32,999 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-11-23 01:56:34,301 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,302 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,303 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,304 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,318 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,370 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,371 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,373 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,374 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,377 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,378 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,379 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,380 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:34,834 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-23 01:56:34,836 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-23 01:56:34,838 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-23 01:56:34,841 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-23 01:56:34,843 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-23 01:56:34,844 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-23 01:56:34,845 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-23 01:56:34,846 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-23 01:56:34,847 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-23 01:56:34,863 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-23 01:56:35,058 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-23 01:56:35,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:56:35,154 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:56:35,186 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4498,4511] [2022-11-23 01:56:35,199 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_back_harness.i[4558,4571] [2022-11-23 01:56:35,309 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,310 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,323 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,324 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,325 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,335 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,338 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,340 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,349 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,351 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,352 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,353 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,354 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 01:56:35,435 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-23 01:56:35,436 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-23 01:56:35,438 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-23 01:56:35,439 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-23 01:56:35,440 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-23 01:56:35,441 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-23 01:56:35,442 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-23 01:56:35,444 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-23 01:56:35,445 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-23 01:56:35,445 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-23 01:56:35,500 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-23 01:56:35,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:56:35,856 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:56:35,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35 WrapperNode [2022-11-23 01:56:35,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:56:35,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:56:35,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:56:35,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:56:35,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35" (1/1) ... [2022-11-23 01:56:35,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35" (1/1) ... [2022-11-23 01:56:36,006 INFO L138 Inliner]: procedures = 679, calls = 1045, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 224 [2022-11-23 01:56:36,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:56:36,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:56:36,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:56:36,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:56:36,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35" (1/1) ... [2022-11-23 01:56:36,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35" (1/1) ... [2022-11-23 01:56:36,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35" (1/1) ... [2022-11-23 01:56:36,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35" (1/1) ... [2022-11-23 01:56:36,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35" (1/1) ... [2022-11-23 01:56:36,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35" (1/1) ... [2022-11-23 01:56:36,071 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35" (1/1) ... [2022-11-23 01:56:36,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35" (1/1) ... [2022-11-23 01:56:36,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:56:36,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:56:36,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:56:36,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:56:36,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35" (1/1) ... [2022-11-23 01:56:36,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:56:36,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:56:36,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 01:56:36,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 01:56:36,203 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2022-11-23 01:56:36,203 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2022-11-23 01:56:36,203 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2022-11-23 01:56:36,203 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2022-11-23 01:56:36,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 01:56:36,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 01:56:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 01:56:36,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 01:56:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-11-23 01:56:36,206 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-11-23 01:56:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 01:56:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-11-23 01:56:36,206 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-11-23 01:56:36,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 01:56:36,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 01:56:36,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:56:36,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:56:36,209 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-11-23 01:56:36,209 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-11-23 01:56:36,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-23 01:56:36,209 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-23 01:56:36,210 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-23 01:56:36,210 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-23 01:56:36,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 01:56:36,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 01:56:36,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 01:56:36,212 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-23 01:56:36,212 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-23 01:56:36,212 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-11-23 01:56:36,212 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-11-23 01:56:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 01:56:36,648 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:56:36,651 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:56:37,226 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:56:37,236 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:56:37,239 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-23 01:56:37,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:56:37 BoogieIcfgContainer [2022-11-23 01:56:37,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:56:37,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 01:56:37,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 01:56:37,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 01:56:37,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:56:32" (1/3) ... [2022-11-23 01:56:37,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c7d5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:56:37, skipping insertion in model container [2022-11-23 01:56:37,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:35" (2/3) ... [2022-11-23 01:56:37,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c7d5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:56:37, skipping insertion in model container [2022-11-23 01:56:37,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:56:37" (3/3) ... [2022-11-23 01:56:37,266 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_back_harness.i [2022-11-23 01:56:37,290 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 01:56:37,290 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 01:56:37,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 01:56:37,390 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;@2aaa70c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 01:56:37,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 01:56:37,396 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-23 01:56:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-23 01:56:37,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:56:37,421 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-23 01:56:37,422 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:56:37,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:56:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1579343520, now seen corresponding path program 1 times [2022-11-23 01:56:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:56:37,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378417969] [2022-11-23 01:56:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:56:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:56:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:56:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:56:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:56:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:56:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:56:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:56:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:56:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:56:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:56:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 01:56:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-23 01:56:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-23 01:56:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-23 01:56:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:56:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-23 01:56:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-23 01:56:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:38,757 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-23 01:56:38,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:56:38,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378417969] [2022-11-23 01:56:38,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378417969] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:56:38,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743566199] [2022-11-23 01:56:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:56:38,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:56:38,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:56:38,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:56:38,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 01:56:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:39,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 01:56:39,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:56:39,200 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-23 01:56:39,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:56:39,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743566199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:56:39,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 01:56:39,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-23 01:56:39,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291980647] [2022-11-23 01:56:39,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:56:39,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:56:39,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:56:39,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:56:39,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:56:39,248 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-23 01:56:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:56:39,342 INFO L93 Difference]: Finished difference Result 274 states and 414 transitions. [2022-11-23 01:56:39,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:56:39,346 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-23 01:56:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:56:39,358 INFO L225 Difference]: With dead ends: 274 [2022-11-23 01:56:39,358 INFO L226 Difference]: Without dead ends: 140 [2022-11-23 01:56:39,369 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-23 01:56:39,375 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-23 01:56:39,379 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-23 01:56:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-23 01:56:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2022-11-23 01:56:39,465 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-23 01:56:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 180 transitions. [2022-11-23 01:56:39,478 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 180 transitions. Word has length 116 [2022-11-23 01:56:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:56:39,480 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 180 transitions. [2022-11-23 01:56:39,481 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-23 01:56:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2022-11-23 01:56:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-23 01:56:39,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:56:39,485 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-23 01:56:39,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 01:56:39,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-23 01:56:39,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:56:39,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:56:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash -183799078, now seen corresponding path program 1 times [2022-11-23 01:56:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:56:39,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778644536] [2022-11-23 01:56:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:56:39,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:56:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:56:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:39,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:56:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:39,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:56:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:56:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:56:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:56:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:56:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:56:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:56:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 01:56:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-23 01:56:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-23 01:56:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-23 01:56:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:56:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-23 01:56:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-23 01:56:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,199 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-23 01:56:40,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:56:40,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778644536] [2022-11-23 01:56:40,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778644536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:56:40,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455925322] [2022-11-23 01:56:40,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:56:40,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:56:40,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:56:40,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:56:40,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 01:56:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:40,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 01:56:40,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:56:40,505 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-23 01:56:40,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:56:40,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455925322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:56:40,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 01:56:40,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-23 01:56:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167438525] [2022-11-23 01:56:40,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:56:40,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 01:56:40,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:56:40,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 01:56:40,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 01:56:40,509 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-23 01:56:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:56:40,561 INFO L93 Difference]: Finished difference Result 252 states and 345 transitions. [2022-11-23 01:56:40,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 01:56:40,562 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-23 01:56:40,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:56:40,565 INFO L225 Difference]: With dead ends: 252 [2022-11-23 01:56:40,565 INFO L226 Difference]: Without dead ends: 138 [2022-11-23 01:56:40,566 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-23 01:56:40,567 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-23 01:56:40,568 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-23 01:56:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-23 01:56:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2022-11-23 01:56:40,580 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-23 01:56:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2022-11-23 01:56:40,583 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 116 [2022-11-23 01:56:40,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:56:40,590 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2022-11-23 01:56:40,590 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-23 01:56:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2022-11-23 01:56:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-23 01:56:40,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:56:40,593 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-23 01:56:40,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 01:56:40,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:56:40,794 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:56:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:56:40,795 INFO L85 PathProgramCache]: Analyzing trace with hash -543175276, now seen corresponding path program 1 times [2022-11-23 01:56:40,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:56:40,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493302015] [2022-11-23 01:56:40,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:56:40,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:56:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:56:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:56:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:56:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:56:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:56:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:56:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:56:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:56:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:56:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 01:56:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-23 01:56:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-23 01:56:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-23 01:56:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:56:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-23 01:56:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-23 01:56:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:42,729 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-23 01:56:42,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:56:42,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493302015] [2022-11-23 01:56:42,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493302015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:56:42,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547431840] [2022-11-23 01:56:42,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:56:42,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:56:42,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:56:42,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:56:42,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 01:56:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:43,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-23 01:56:43,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:56:43,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 01:56:43,247 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 18 treesize of output 19 [2022-11-23 01:56:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-23 01:56:44,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:56:44,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547431840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:56:44,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 01:56:44,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-11-23 01:56:44,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637603132] [2022-11-23 01:56:44,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:56:44,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 01:56:44,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:56:44,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 01:56:44,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-11-23 01:56:44,341 INFO L87 Difference]: Start difference. First operand 137 states and 183 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-23 01:56:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:56:45,750 INFO L93 Difference]: Finished difference Result 374 states and 504 transitions. [2022-11-23 01:56:45,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 01:56:45,751 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 116 [2022-11-23 01:56:45,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:56:45,756 INFO L225 Difference]: With dead ends: 374 [2022-11-23 01:56:45,756 INFO L226 Difference]: Without dead ends: 257 [2022-11-23 01:56:45,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 133 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2022-11-23 01:56:45,758 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 209 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:56:45,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 878 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 01:56:45,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-11-23 01:56:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 231. [2022-11-23 01:56:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 153 states have (on average 1.2418300653594772) internal successors, (190), 156 states have internal predecessors, (190), 60 states have call successors, (60), 17 states have call predecessors, (60), 17 states have return successors, (61), 57 states have call predecessors, (61), 59 states have call successors, (61) [2022-11-23 01:56:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 311 transitions. [2022-11-23 01:56:45,830 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 311 transitions. Word has length 116 [2022-11-23 01:56:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:56:45,833 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 311 transitions. [2022-11-23 01:56:45,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 5 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-23 01:56:45,834 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 311 transitions. [2022-11-23 01:56:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-23 01:56:45,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:56:45,844 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-23 01:56:45,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 01:56:46,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:56:46,045 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:56:46,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:56:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1369878566, now seen corresponding path program 1 times [2022-11-23 01:56:46,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:56:46,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627444653] [2022-11-23 01:56:46,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:56:46,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:56:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:46,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:56:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:46,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:56:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:46,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:56:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:46,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:56:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:46,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:56:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:46,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:56:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:46,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:56:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:46,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:56:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:46,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:56:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:47,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 01:56:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:47,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-23 01:56:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:47,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-23 01:56:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:47,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-23 01:56:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:47,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:56:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:47,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-23 01:56:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:47,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-23 01:56:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:47,476 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-23 01:56:47,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:56:47,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627444653] [2022-11-23 01:56:47,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627444653] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:56:47,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104540392] [2022-11-23 01:56:47,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:56:47,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:56:47,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:56:47,483 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:56:47,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 01:56:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:56:47,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-23 01:56:47,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:56:47,838 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 01:56:47,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-11-23 01:56:47,857 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 01:56:47,858 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-23 01:56:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 105 proven. 17 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-23 01:56:49,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:56:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-23 01:56:50,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104540392] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:56:50,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:56:50,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 12] total 28 [2022-11-23 01:56:50,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812033162] [2022-11-23 01:56:50,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:56:50,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-23 01:56:50,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:56:50,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-23 01:56:50,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2022-11-23 01:56:50,695 INFO L87 Difference]: Start difference. First operand 231 states and 311 transitions. Second operand has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 10 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-23 01:56:52,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:56:54,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:56:56,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:57:02,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:57:04,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:57:06,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:57:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:57:07,544 INFO L93 Difference]: Finished difference Result 718 states and 979 transitions. [2022-11-23 01:57:07,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 01:57:07,545 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 10 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) Word has length 116 [2022-11-23 01:57:07,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:57:07,551 INFO L225 Difference]: With dead ends: 718 [2022-11-23 01:57:07,551 INFO L226 Difference]: Without dead ends: 523 [2022-11-23 01:57:07,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 241 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=444, Invalid=2208, Unknown=0, NotChecked=0, Total=2652 [2022-11-23 01:57:07,555 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 406 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 190 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-11-23 01:57:07,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 2418 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 14.6s Time] [2022-11-23 01:57:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-23 01:57:07,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 444. [2022-11-23 01:57:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 302 states have (on average 1.2384105960264902) internal successors, (374), 305 states have internal predecessors, (374), 109 states have call successors, (109), 34 states have call predecessors, (109), 32 states have return successors, (118), 104 states have call predecessors, (118), 107 states have call successors, (118) [2022-11-23 01:57:07,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 601 transitions. [2022-11-23 01:57:07,640 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 601 transitions. Word has length 116 [2022-11-23 01:57:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:57:07,641 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 601 transitions. [2022-11-23 01:57:07,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 26 states have internal predecessors, (104), 10 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 10 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-23 01:57:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 601 transitions. [2022-11-23 01:57:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-23 01:57:07,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:57:07,646 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-23 01:57:07,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 01:57:07,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:07,854 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:57:07,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:57:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1275142702, now seen corresponding path program 1 times [2022-11-23 01:57:07,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:57:07,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602336754] [2022-11-23 01:57:07,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:07,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:57:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:57:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:57:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:57:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:57:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:57:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:57:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:57:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 01:57:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-23 01:57:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-23 01:57:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-23 01:57:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-23 01:57:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-23 01:57:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,282 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-23 01:57:08,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:57:08,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602336754] [2022-11-23 01:57:08,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602336754] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:57:08,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346981690] [2022-11-23 01:57:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:08,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:08,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:57:08,285 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:57:08,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 01:57:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:08,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 01:57:08,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:57:08,748 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-23 01:57:08,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:57:08,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346981690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:57:08,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 01:57:08,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-11-23 01:57:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912622427] [2022-11-23 01:57:08,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:57:08,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 01:57:08,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:57:08,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 01:57:08,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-23 01:57:08,752 INFO L87 Difference]: Start difference. First operand 444 states and 601 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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-23 01:57:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:57:09,107 INFO L93 Difference]: Finished difference Result 894 states and 1212 transitions. [2022-11-23 01:57:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 01:57:09,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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 116 [2022-11-23 01:57:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:57:09,118 INFO L225 Difference]: With dead ends: 894 [2022-11-23 01:57:09,119 INFO L226 Difference]: Without dead ends: 438 [2022-11-23 01:57:09,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-23 01:57:09,125 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 215 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 01:57:09,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 728 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 01:57:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-11-23 01:57:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 421. [2022-11-23 01:57:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 298 states have (on average 1.261744966442953) internal successors, (376), 303 states have internal predecessors, (376), 91 states have call successors, (91), 30 states have call predecessors, (91), 31 states have return successors, (102), 87 states have call predecessors, (102), 89 states have call successors, (102) [2022-11-23 01:57:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 569 transitions. [2022-11-23 01:57:09,209 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 569 transitions. Word has length 116 [2022-11-23 01:57:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:57:09,210 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 569 transitions. [2022-11-23 01:57:09,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 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-23 01:57:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 569 transitions. [2022-11-23 01:57:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-23 01:57:09,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:57:09,214 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-23 01:57:09,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-23 01:57:09,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:09,422 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:57:09,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:57:09,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1492302642, now seen corresponding path program 1 times [2022-11-23 01:57:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:57:09,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131710129] [2022-11-23 01:57:09,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:09,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:57:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:57:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:57:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 01:57:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-23 01:57:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-23 01:57:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-23 01:57:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-23 01:57:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-23 01:57:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-23 01:57:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-23 01:57:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-23 01:57:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-23 01:57:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-23 01:57:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:09,921 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-23 01:57:09,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:57:09,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131710129] [2022-11-23 01:57:09,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131710129] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:57:09,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357204894] [2022-11-23 01:57:09,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:09,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:09,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:57:09,924 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:57:09,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 01:57:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:10,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-23 01:57:10,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:57:10,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 01:57:10,479 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 01:57:10,479 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-23 01:57:10,495 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-23 01:57:10,500 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-23 01:57:10,610 INFO L321 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-11-23 01:57:10,611 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-23 01:57:10,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 01:57:10,621 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-23 01:57:10,631 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-23 01:57:10,757 WARN L859 $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_back_harness_~#list~0#1.base_BEFORE_CALL_13| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#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_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_2) .cse0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|)) (not (= .cse0 0)))))) is different from true [2022-11-23 01:57:11,025 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (select .cse1 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|))) (let ((.cse2 (select .cse3 0))) (and (= (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_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2)) (= (select .cse3 24) (select v_DerPreprocessor_4 24)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|)) (not (= .cse2 0))))))) is different from true [2022-11-23 01:57:11,624 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (select .cse1 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|))) (let ((.cse2 (select .cse3 0))) (and (= (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_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2)) (= (select .cse3 24) (select v_DerPreprocessor_4 24)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|)) (not (= .cse2 0)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))) (let ((.cse4 (select .cse5 0))) (and (not (= .cse4 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_8) .cse4 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_8) .cse4) (select |c_#memory_$Pointer$.base| .cse4)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| .cse4)) (= (select .cse5 24) (select v_DerPreprocessor_8 24)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|))) (let ((.cse6 (select .cse7 0))) (and (not (= .cse6 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|)) (= (select .cse7 24) (select v_DerPreprocessor_6 24)) (not (= .cse6 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_6) .cse6 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_6) .cse6) (select |c_#memory_$Pointer$.base| .cse6))))))) is different from true [2022-11-23 01:57:12,544 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (select .cse1 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|))) (let ((.cse2 (select .cse3 0))) (and (= (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_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2)) (= (select .cse3 24) (select v_DerPreprocessor_4 24)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|)) (not (= .cse2 0)))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|))) (let ((.cse5 (select .cse4 0))) (and (= (select v_DerPreprocessor_10 24) (select .cse4 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| .cse5)) (not (= .cse5 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_10) .cse5 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_10) .cse5) (select |c_#memory_$Pointer$.base| .cse5)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))) (let ((.cse6 (select .cse7 0))) (and (not (= .cse6 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_8) .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_8) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| .cse6)) (= (select .cse7 24) (select v_DerPreprocessor_8 24)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|))) (let ((.cse8 (select .cse9 0))) (and (not (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|)) (= (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_back_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_6) .cse8 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_6) .cse8) (select |c_#memory_$Pointer$.base| .cse8))))))) is different from true [2022-11-23 01:57:13,300 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|))) (let ((.cse0 (select .cse1 0))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14| v_DerPreprocessor_2) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (not (= .cse0 0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_14|)))))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| Int) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|))) (let ((.cse2 (select .cse3 0))) (and (= (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_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2 v_DerPreprocessor_3) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_4) .cse2)) (= (select .cse3 24) (select v_DerPreprocessor_4 24)) (not (= .cse2 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|)) (not (= .cse2 0)))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| Int)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11|))) (let ((.cse5 (select .cse4 0))) (and (= (select v_DerPreprocessor_10 24) (select .cse4 24)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| .cse5)) (not (= .cse5 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse5 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_10) .cse5 v_DerPreprocessor_9) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_10) .cse5) (select |c_#memory_$Pointer$.base| .cse5)))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15|))) (let ((.cse6 (select .cse7 0))) (and (not (= .cse6 0)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_8) .cse6 v_DerPreprocessor_7) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| v_DerPreprocessor_8) .cse6) (select |c_#memory_$Pointer$.base| .cse6)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_15| .cse6)) (= (select .cse7 24) (select v_DerPreprocessor_8 24)))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| Int)) (let ((.cse9 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|))) (let ((.cse8 (select .cse9 0))) (and (not (= .cse8 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10|)) (= (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_back_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_6) .cse8 v_DerPreprocessor_5) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_10| v_DerPreprocessor_6) .cse8) (select |c_#memory_$Pointer$.base| .cse8)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|))) (let ((.cse11 (select .cse10 0))) (and (= (select .cse10 24) (select v_DerPreprocessor_11 24)) (= (select |c_#memory_$Pointer$.base| .cse11) (select (store (store (store (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| v_DerPreprocessor_11) .cse11 v_DerPreprocessor_12) |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12| v_DerPreprocessor_11) .cse11)) (not (= .cse11 |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_12|)) (not (= .cse11 0))))))) is different from true [2022-11-23 01:57:15,308 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-23 01:57:15,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:57:16,136 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 01:57:16,137 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-23 01:57:16,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 01:57:16,161 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-23 01:57:16,172 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-23 01:57:16,182 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-23 01:57:16,277 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-23 01:57:16,325 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-23 01:57:16,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 01:57:16,362 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 113 treesize of output 105 [2022-11-23 01:57:16,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357204894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:57:16,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 01:57:16,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 21] total 25 [2022-11-23 01:57:16,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496285074] [2022-11-23 01:57:16,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 01:57:16,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 01:57:16,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:57:16,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 01:57:16,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=706, Unknown=33, NotChecked=290, Total=1122 [2022-11-23 01:57:16,899 INFO L87 Difference]: Start difference. First operand 421 states and 569 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-23 01:57:17,988 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_5| Int)) (= (select |c_#valid| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base_BEFORE_CALL_5|) 1)) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#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_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13| v_DerPreprocessor_2) .cse0)) (= (select .cse1 24) (select v_DerPreprocessor_2 24)) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base_BEFORE_CALL_13|)) (not (= .cse0 0))))))) is different from true [2022-11-23 01:57:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:57:25,999 INFO L93 Difference]: Finished difference Result 985 states and 1320 transitions. [2022-11-23 01:57:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-23 01:57:26,000 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-23 01:57:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:57:26,004 INFO L225 Difference]: With dead ends: 985 [2022-11-23 01:57:26,004 INFO L226 Difference]: Without dead ends: 556 [2022-11-23 01:57:26,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=241, Invalid=2138, Unknown=95, NotChecked=606, Total=3080 [2022-11-23 01:57:26,008 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 266 mSDsluCounter, 3385 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 91 mSolverCounterUnsat, 164 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 3663 SdHoareTripleChecker+Invalid, 3633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 164 IncrementalHoareTripleChecker+Unknown, 1665 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-23 01:57:26,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 3663 Invalid, 3633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1713 Invalid, 164 Unknown, 1665 Unchecked, 6.2s Time] [2022-11-23 01:57:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-11-23 01:57:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 520. [2022-11-23 01:57:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 360 states have (on average 1.2277777777777779) internal successors, (442), 366 states have internal predecessors, (442), 112 states have call successors, (112), 45 states have call predecessors, (112), 47 states have return successors, (122), 108 states have call predecessors, (122), 108 states have call successors, (122) [2022-11-23 01:57:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 676 transitions. [2022-11-23 01:57:26,080 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 676 transitions. Word has length 118 [2022-11-23 01:57:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:57:26,080 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 676 transitions. [2022-11-23 01:57:26,081 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-23 01:57:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 676 transitions. [2022-11-23 01:57:26,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-23 01:57:26,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:57:26,084 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-23 01:57:26,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-23 01:57:26,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:26,292 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:57:26,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:57:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1991074974, now seen corresponding path program 1 times [2022-11-23 01:57:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:57:26,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571594615] [2022-11-23 01:57:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:26,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:57:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:57:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:57:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:57:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:57:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:57:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:57:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:57:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-23 01:57:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-23 01:57:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-23 01:57:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-23 01:57:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-23 01:57:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-23 01:57:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:26,802 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-23 01:57:26,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:57:26,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571594615] [2022-11-23 01:57:26,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571594615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:57:26,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127799160] [2022-11-23 01:57:26,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:26,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:26,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:57:26,805 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:57:26,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 01:57:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:27,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 01:57:27,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:57:27,223 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-23 01:57:27,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:57:27,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127799160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:57:27,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 01:57:27,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2022-11-23 01:57:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133009097] [2022-11-23 01:57:27,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:57:27,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 01:57:27,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:57:27,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 01:57:27,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-23 01:57:27,226 INFO L87 Difference]: Start difference. First operand 520 states and 676 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-23 01:57:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:57:27,673 INFO L93 Difference]: Finished difference Result 940 states and 1251 transitions. [2022-11-23 01:57:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 01:57:27,674 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-23 01:57:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:57:27,678 INFO L225 Difference]: With dead ends: 940 [2022-11-23 01:57:27,678 INFO L226 Difference]: Without dead ends: 535 [2022-11-23 01:57:27,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-11-23 01:57:27,681 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 219 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 735 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.3s IncrementalHoareTripleChecker+Time [2022-11-23 01:57:27,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 735 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 01:57:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-11-23 01:57:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 520. [2022-11-23 01:57:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 360 states have (on average 1.2194444444444446) internal successors, (439), 366 states have internal predecessors, (439), 112 states have call successors, (112), 45 states have call predecessors, (112), 47 states have return successors, (122), 108 states have call predecessors, (122), 108 states have call successors, (122) [2022-11-23 01:57:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 673 transitions. [2022-11-23 01:57:27,744 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 673 transitions. Word has length 118 [2022-11-23 01:57:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:57:27,745 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 673 transitions. [2022-11-23 01:57:27,745 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-23 01:57:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 673 transitions. [2022-11-23 01:57:27,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-23 01:57:27,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:57:27,747 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-23 01:57:27,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 01:57:27,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-23 01:57:27,955 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:57:27,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:57:27,955 INFO L85 PathProgramCache]: Analyzing trace with hash -267467697, now seen corresponding path program 1 times [2022-11-23 01:57:27,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:57:27,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171350220] [2022-11-23 01:57:27,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:27,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:57:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:57:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:57:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:57:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:57:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:57:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:57:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:57:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-23 01:57:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-23 01:57:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-23 01:57:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-23 01:57:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-23 01:57:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-23 01:57:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,461 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-23 01:57:28,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:57:28,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171350220] [2022-11-23 01:57:28,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171350220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:57:28,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217129201] [2022-11-23 01:57:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:28,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:28,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:57:28,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:57:28,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 01:57:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:28,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 01:57:28,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:57:28,935 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-23 01:57:28,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:57:28,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217129201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:57:28,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 01:57:28,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-11-23 01:57:28,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152934981] [2022-11-23 01:57:28,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:57:28,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 01:57:28,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:57:28,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 01:57:28,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-11-23 01:57:28,938 INFO L87 Difference]: Start difference. First operand 520 states and 673 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-23 01:57:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:57:29,521 INFO L93 Difference]: Finished difference Result 1000 states and 1348 transitions. [2022-11-23 01:57:29,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 01:57:29,522 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-23 01:57:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:57:29,527 INFO L225 Difference]: With dead ends: 1000 [2022-11-23 01:57:29,528 INFO L226 Difference]: Without dead ends: 592 [2022-11-23 01:57:29,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-11-23 01:57:29,534 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 261 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 847 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.4s IncrementalHoareTripleChecker+Time [2022-11-23 01:57:29,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 847 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 01:57:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-11-23 01:57:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 524. [2022-11-23 01:57:29,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 364 states have (on average 1.2197802197802199) internal successors, (444), 370 states have internal predecessors, (444), 112 states have call successors, (112), 45 states have call predecessors, (112), 47 states have return successors, (122), 108 states have call predecessors, (122), 108 states have call successors, (122) [2022-11-23 01:57:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 678 transitions. [2022-11-23 01:57:29,614 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 678 transitions. Word has length 120 [2022-11-23 01:57:29,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:57:29,614 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 678 transitions. [2022-11-23 01:57:29,614 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-23 01:57:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 678 transitions. [2022-11-23 01:57:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-23 01:57:29,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:57:29,619 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-23 01:57:29,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 01:57:29,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:29,827 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:57:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:57:29,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1914003673, now seen corresponding path program 1 times [2022-11-23 01:57:29,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:57:29,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974295361] [2022-11-23 01:57:29,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:29,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:57:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:57:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:57:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:57:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:57:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:57:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:57:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:57:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-23 01:57:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-23 01:57:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-23 01:57:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-23 01:57:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-23 01:57:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-23 01:57:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,285 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-23 01:57:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:57:30,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974295361] [2022-11-23 01:57:30,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974295361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:57:30,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735010196] [2022-11-23 01:57:30,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:30,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:30,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:57:30,288 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:57:30,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 01:57:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:30,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 01:57:30,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:57:30,595 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-23 01:57:30,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:57:30,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735010196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:57:30,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 01:57:30,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 01:57:30,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550823841] [2022-11-23 01:57:30,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:57:30,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 01:57:30,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:57:30,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 01:57:30,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:57:30,600 INFO L87 Difference]: Start difference. First operand 524 states and 678 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-23 01:57:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:57:30,689 INFO L93 Difference]: Finished difference Result 970 states and 1307 transitions. [2022-11-23 01:57:30,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 01:57:30,690 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-23 01:57:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:57:30,694 INFO L225 Difference]: With dead ends: 970 [2022-11-23 01:57:30,694 INFO L226 Difference]: Without dead ends: 564 [2022-11-23 01:57:30,697 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-23 01:57:30,699 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 6 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 354 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-23 01:57:30,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 354 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 01:57:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-23 01:57:30,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 532. [2022-11-23 01:57:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 372 states have (on average 1.2204301075268817) internal successors, (454), 378 states have internal predecessors, (454), 112 states have call successors, (112), 45 states have call predecessors, (112), 47 states have return successors, (122), 108 states have call predecessors, (122), 108 states have call successors, (122) [2022-11-23 01:57:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 688 transitions. [2022-11-23 01:57:30,775 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 688 transitions. Word has length 121 [2022-11-23 01:57:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:57:30,776 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 688 transitions. [2022-11-23 01:57:30,776 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-23 01:57:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 688 transitions. [2022-11-23 01:57:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-23 01:57:30,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:57:30,780 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-23 01:57:30,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 01:57:30,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-23 01:57:30,988 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:57:30,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:57:30,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1363735611, now seen corresponding path program 1 times [2022-11-23 01:57:30,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:57:30,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438569991] [2022-11-23 01:57:30,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:30,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:57:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:57:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:57:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:57:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:57:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:57:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:57:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:57:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 01:57:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-23 01:57:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-23 01:57:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-23 01:57:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-23 01:57:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-23 01:57:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-23 01:57:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,493 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-23 01:57:31,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:57:31,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438569991] [2022-11-23 01:57:31,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438569991] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:57:31,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208631591] [2022-11-23 01:57:31,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:31,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:31,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:57:31,496 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:57:31,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 01:57:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:31,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-23 01:57:31,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:57:32,059 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-23 01:57:32,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:57:32,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208631591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:57:32,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 01:57:32,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 14 [2022-11-23 01:57:32,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202338754] [2022-11-23 01:57:32,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:57:32,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 01:57:32,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:57:32,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 01:57:32,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-11-23 01:57:32,062 INFO L87 Difference]: Start difference. First operand 532 states and 688 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-23 01:57:32,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:57:32,806 INFO L93 Difference]: Finished difference Result 960 states and 1273 transitions. [2022-11-23 01:57:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 01:57:32,807 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-23 01:57:32,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:57:32,812 INFO L225 Difference]: With dead ends: 960 [2022-11-23 01:57:32,812 INFO L226 Difference]: Without dead ends: 550 [2022-11-23 01:57:32,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-11-23 01:57:32,815 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 182 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 01:57:32,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1159 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 01:57:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-23 01:57:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 533. [2022-11-23 01:57:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 373 states have (on average 1.2144772117962466) internal successors, (453), 379 states have internal predecessors, (453), 112 states have call successors, (112), 45 states have call predecessors, (112), 47 states have return successors, (122), 108 states have call predecessors, (122), 108 states have call successors, (122) [2022-11-23 01:57:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 687 transitions. [2022-11-23 01:57:32,894 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 687 transitions. Word has length 129 [2022-11-23 01:57:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:57:32,894 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 687 transitions. [2022-11-23 01:57:32,895 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-23 01:57:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 687 transitions. [2022-11-23 01:57:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-23 01:57:32,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:57:32,898 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, 1, 1] [2022-11-23 01:57:32,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 01:57:33,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:33,106 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:57:33,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:57:33,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1814934808, now seen corresponding path program 1 times [2022-11-23 01:57:33,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:57:33,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150442396] [2022-11-23 01:57:33,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:33,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:57:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:57:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:57:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:57:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:57:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:57:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:57:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:57:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 01:57:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-23 01:57:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-23 01:57:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-23 01:57:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-23 01:57:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-23 01:57:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-23 01:57:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:33,818 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-23 01:57:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:57:33,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150442396] [2022-11-23 01:57:33,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150442396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:57:33,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185913434] [2022-11-23 01:57:33,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:33,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:33,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:57:33,820 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:57:33,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 01:57:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:34,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-23 01:57:34,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:57:34,197 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 01:57:34,197 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-23 01:57:34,218 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 01:57:34,219 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-23 01:57:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 103 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-23 01:57:35,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:57:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-23 01:57:36,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185913434] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:57:36,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:57:36,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 13] total 33 [2022-11-23 01:57:36,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938785676] [2022-11-23 01:57:36,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:57:36,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 01:57:36,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:57:36,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 01:57:36,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 01:57:36,861 INFO L87 Difference]: Start difference. First operand 533 states and 687 transitions. Second operand has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 31 states have internal predecessors, (136), 13 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2022-11-23 01:57:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:57:39,113 INFO L93 Difference]: Finished difference Result 1063 states and 1458 transitions. [2022-11-23 01:57:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 01:57:39,114 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 31 states have internal predecessors, (136), 13 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) Word has length 131 [2022-11-23 01:57:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:57:39,119 INFO L225 Difference]: With dead ends: 1063 [2022-11-23 01:57:39,119 INFO L226 Difference]: Without dead ends: 650 [2022-11-23 01:57:39,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 270 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=218, Invalid=1422, Unknown=0, NotChecked=0, Total=1640 [2022-11-23 01:57:39,123 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 405 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-23 01:57:39,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 2689 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-23 01:57:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-11-23 01:57:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 551. [2022-11-23 01:57:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 385 states have (on average 1.2103896103896103) internal successors, (466), 391 states have internal predecessors, (466), 118 states have call successors, (118), 45 states have call predecessors, (118), 47 states have return successors, (128), 114 states have call predecessors, (128), 114 states have call successors, (128) [2022-11-23 01:57:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2022-11-23 01:57:39,213 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 131 [2022-11-23 01:57:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:57:39,214 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2022-11-23 01:57:39,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 31 states have internal predecessors, (136), 13 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2022-11-23 01:57:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2022-11-23 01:57:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-23 01:57:39,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:57:39,218 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-23 01:57:39,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 01:57:39,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:39,426 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:57:39,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:57:39,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1187163488, now seen corresponding path program 1 times [2022-11-23 01:57:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:57:39,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974833216] [2022-11-23 01:57:39,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:39,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:57:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:57:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:57:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:57:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:57:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:57:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:57:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:57:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 01:57:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-23 01:57:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-23 01:57:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-23 01:57:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-23 01:57:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:57:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-23 01:57:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-23 01:57:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:39,911 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-23 01:57:39,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:57:39,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974833216] [2022-11-23 01:57:39,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974833216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:57:39,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355359588] [2022-11-23 01:57:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:57:39,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:57:39,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:57:39,919 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:57:39,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 01:57:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:57:40,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-23 01:57:40,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:57:40,338 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 01:57:40,338 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-23 01:57:40,361 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 01:57:40,362 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-23 01:57:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 110 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-23 01:57:41,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:57:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-11-23 01:57:42,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355359588] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:57:42,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:57:42,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 10] total 26 [2022-11-23 01:57:42,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194075283] [2022-11-23 01:57:42,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:57:42,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 01:57:42,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:57:42,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 01:57:42,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2022-11-23 01:57:42,800 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand has 26 states, 25 states have (on average 5.36) internal successors, (134), 23 states have internal predecessors, (134), 12 states have call successors, (38), 4 states have call predecessors, (38), 8 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) [2022-11-23 01:57:45,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:57:47,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:57:49,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:57:53,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:57:55,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:57:57,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:57:59,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:01,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:01,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:58:01,831 INFO L93 Difference]: Finished difference Result 1085 states and 1437 transitions. [2022-11-23 01:58:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-23 01:58:01,832 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.36) internal successors, (134), 23 states have internal predecessors, (134), 12 states have call successors, (38), 4 states have call predecessors, (38), 8 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) Word has length 132 [2022-11-23 01:58:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:58:01,837 INFO L225 Difference]: With dead ends: 1085 [2022-11-23 01:58:01,837 INFO L226 Difference]: Without dead ends: 667 [2022-11-23 01:58:01,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 273 SyntacticMatches, 11 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=306, Invalid=2046, Unknown=0, NotChecked=0, Total=2352 [2022-11-23 01:58:01,841 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 293 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 194 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-11-23 01:58:01,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 2158 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1409 Invalid, 8 Unknown, 0 Unchecked, 18.0s Time] [2022-11-23 01:58:01,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-11-23 01:58:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 628. [2022-11-23 01:58:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 440 states have (on average 1.2113636363636364) internal successors, (533), 451 states have internal predecessors, (533), 130 states have call successors, (130), 50 states have call predecessors, (130), 57 states have return successors, (151), 126 states have call predecessors, (151), 124 states have call successors, (151) [2022-11-23 01:58:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 814 transitions. [2022-11-23 01:58:01,941 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 814 transitions. Word has length 132 [2022-11-23 01:58:01,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:58:01,942 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 814 transitions. [2022-11-23 01:58:01,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.36) internal successors, (134), 23 states have internal predecessors, (134), 12 states have call successors, (38), 4 states have call predecessors, (38), 8 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) [2022-11-23 01:58:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 814 transitions. [2022-11-23 01:58:01,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-23 01:58:01,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:58:01,946 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-23 01:58:01,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 01:58:02,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 01:58:02,154 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:58:02,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:02,155 INFO L85 PathProgramCache]: Analyzing trace with hash 800652698, now seen corresponding path program 1 times [2022-11-23 01:58:02,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:02,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108151094] [2022-11-23 01:58:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:02,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:58:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:58:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:58:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:58:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:58:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:58:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:58:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:58:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:58:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 01:58:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-23 01:58:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-23 01:58:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-23 01:58:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-23 01:58:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:58:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-23 01:58:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-23 01:58:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-23 01:58:02,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:02,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108151094] [2022-11-23 01:58:02,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108151094] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:58:02,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074796704] [2022-11-23 01:58:02,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:02,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:58:02,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:58:02,671 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:58:02,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 01:58:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:02,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-23 01:58:02,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:58:03,148 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-23 01:58:03,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:58:03,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074796704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:03,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 01:58:03,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2022-11-23 01:58:03,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698929226] [2022-11-23 01:58:03,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:03,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 01:58:03,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:03,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 01:58:03,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-23 01:58:03,151 INFO L87 Difference]: Start difference. First operand 628 states and 814 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-23 01:58:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:58:03,651 INFO L93 Difference]: Finished difference Result 1115 states and 1463 transitions. [2022-11-23 01:58:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 01:58:03,652 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-23 01:58:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:58:03,662 INFO L225 Difference]: With dead ends: 1115 [2022-11-23 01:58:03,662 INFO L226 Difference]: Without dead ends: 628 [2022-11-23 01:58:03,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-11-23 01:58:03,668 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 229 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 845 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-23 01:58:03,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 845 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 01:58:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-11-23 01:58:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2022-11-23 01:58:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 440 states have (on average 1.2045454545454546) internal successors, (530), 451 states have internal predecessors, (530), 130 states have call successors, (130), 50 states have call predecessors, (130), 57 states have return successors, (151), 126 states have call predecessors, (151), 124 states have call successors, (151) [2022-11-23 01:58:03,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 811 transitions. [2022-11-23 01:58:03,802 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 811 transitions. Word has length 134 [2022-11-23 01:58:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:58:03,803 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 811 transitions. [2022-11-23 01:58:03,803 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-23 01:58:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 811 transitions. [2022-11-23 01:58:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-23 01:58:03,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:58:03,806 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-23 01:58:03,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 01:58:04,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 01:58:04,014 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:58:04,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:04,014 INFO L85 PathProgramCache]: Analyzing trace with hash 315027163, now seen corresponding path program 1 times [2022-11-23 01:58:04,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:04,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73413784] [2022-11-23 01:58:04,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:04,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:58:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:58:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:58:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:58:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:58:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:58:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:58:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:58:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:58:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 01:58:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-23 01:58:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-23 01:58:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 01:58:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-23 01:58:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-23 01:58:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:58:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-23 01:58:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-23 01:58:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,512 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-23 01:58:04,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:04,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73413784] [2022-11-23 01:58:04,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73413784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:58:04,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556883181] [2022-11-23 01:58:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:04,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:58:04,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:58:04,514 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:58:04,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 01:58:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:04,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-23 01:58:04,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:58:05,026 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-23 01:58:05,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:58:05,354 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-23 01:58:05,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556883181] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:58:05,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:58:05,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 7] total 18 [2022-11-23 01:58:05,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463596791] [2022-11-23 01:58:05,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:58:05,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 01:58:05,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:05,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 01:58:05,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-11-23 01:58:05,357 INFO L87 Difference]: Start difference. First operand 628 states and 811 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-23 01:58:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:58:05,906 INFO L93 Difference]: Finished difference Result 1161 states and 1526 transitions. [2022-11-23 01:58:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 01:58:05,907 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-23 01:58:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:58:05,912 INFO L225 Difference]: With dead ends: 1161 [2022-11-23 01:58:05,912 INFO L226 Difference]: Without dead ends: 680 [2022-11-23 01:58:05,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-11-23 01:58:05,915 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 11 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 01:58:05,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2451 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 01:58:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-11-23 01:58:06,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 631. [2022-11-23 01:58:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 443 states have (on average 1.2031602708803613) internal successors, (533), 454 states have internal predecessors, (533), 130 states have call successors, (130), 50 states have call predecessors, (130), 57 states have return successors, (151), 126 states have call predecessors, (151), 124 states have call successors, (151) [2022-11-23 01:58:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 814 transitions. [2022-11-23 01:58:06,022 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 814 transitions. Word has length 145 [2022-11-23 01:58:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:58:06,022 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 814 transitions. [2022-11-23 01:58:06,023 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-23 01:58:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 814 transitions. [2022-11-23 01:58:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-23 01:58:06,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:58:06,025 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-23 01:58:06,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 01:58:06,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 01:58:06,234 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:58:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash 900691480, now seen corresponding path program 1 times [2022-11-23 01:58:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:06,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290269176] [2022-11-23 01:58:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:06,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:07,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:58:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:58:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:58:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:07,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:58:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:07,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:58:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:07,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:58:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:07,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:58:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:58:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:07,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:58:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:08,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 01:58:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:08,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-23 01:58:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:08,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-23 01:58:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:08,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 01:58:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:08,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-23 01:58:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-23 01:58:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:08,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:58:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:08,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-23 01:58:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:08,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-23 01:58:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-23 01:58:08,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:08,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290269176] [2022-11-23 01:58:08,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290269176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:58:08,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519462983] [2022-11-23 01:58:08,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:08,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:58:08,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:58:08,787 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:58:08,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 01:58:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:09,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-23 01:58:09,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:58:09,321 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-23 01:58:09,325 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-23 01:58:09,332 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-23 01:58:11,322 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-23 01:58:13,711 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-23 01:58:13,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 01:58:15,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 01:58:15,411 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-23 01:58:15,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 01:58:15,443 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-23 01:58:15,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 01:58:15,466 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-23 01:58:15,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 01:58:15,605 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 106 treesize of output 100 [2022-11-23 01:58:15,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 01:58:15,613 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 100 treesize of output 94 [2022-11-23 01:58:15,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 01:58:15,629 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 106 treesize of output 94 [2022-11-23 01:58:15,656 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 138 treesize of output 130 [2022-11-23 01:58:15,664 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-23 01:58:15,672 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-23 01:58:15,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-11-23 01:58:15,930 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-23 01:58:15,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519462983] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 01:58:15,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 01:58:15,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 18] total 51 [2022-11-23 01:58:15,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902278631] [2022-11-23 01:58:15,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 01:58:15,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-23 01:58:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-23 01:58:15,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2364, Unknown=0, NotChecked=0, Total=2550 [2022-11-23 01:58:15,934 INFO L87 Difference]: Start difference. First operand 631 states and 814 transitions. Second operand has 51 states, 49 states have (on average 3.938775510204082) internal successors, (193), 47 states have internal predecessors, (193), 22 states have call successors, (49), 4 states have call predecessors, (49), 10 states have return successors, (48), 21 states have call predecessors, (48), 22 states have call successors, (48) [2022-11-23 01:58:17,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:20,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:22,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:24,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:26,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:28,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:30,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:32,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:43,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:45,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:47,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:49,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:52,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:54,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 01:58:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:58:56,196 INFO L93 Difference]: Finished difference Result 1265 states and 1717 transitions. [2022-11-23 01:58:56,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-23 01:58:56,197 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 3.938775510204082) internal successors, (193), 47 states have internal predecessors, (193), 22 states have call successors, (49), 4 states have call predecessors, (49), 10 states have return successors, (48), 21 states have call predecessors, (48), 22 states have call successors, (48) Word has length 148 [2022-11-23 01:58:56,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:58:56,203 INFO L225 Difference]: With dead ends: 1265 [2022-11-23 01:58:56,203 INFO L226 Difference]: Without dead ends: 761 [2022-11-23 01:58:56,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 287 SyntacticMatches, 18 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2377 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=814, Invalid=7742, Unknown=0, NotChecked=0, Total=8556 [2022-11-23 01:58:56,209 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 740 mSDsluCounter, 4977 mSDsCounter, 0 mSdLazyCounter, 5213 mSolverCounterSat, 465 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 5188 SdHoareTripleChecker+Invalid, 5692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 5213 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.2s IncrementalHoareTripleChecker+Time [2022-11-23 01:58:56,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 5188 Invalid, 5692 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [465 Valid, 5213 Invalid, 14 Unknown, 0 Unchecked, 36.2s Time] [2022-11-23 01:58:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-11-23 01:58:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 635. [2022-11-23 01:58:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 447 states have (on average 1.2013422818791946) internal successors, (537), 458 states have internal predecessors, (537), 130 states have call successors, (130), 50 states have call predecessors, (130), 57 states have return successors, (151), 126 states have call predecessors, (151), 124 states have call successors, (151) [2022-11-23 01:58:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 818 transitions. [2022-11-23 01:58:56,396 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 818 transitions. Word has length 148 [2022-11-23 01:58:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:58:56,397 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 818 transitions. [2022-11-23 01:58:56,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 3.938775510204082) internal successors, (193), 47 states have internal predecessors, (193), 22 states have call successors, (49), 4 states have call predecessors, (49), 10 states have return successors, (48), 21 states have call predecessors, (48), 22 states have call successors, (48) [2022-11-23 01:58:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 818 transitions. [2022-11-23 01:58:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-23 01:58:56,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:58:56,400 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] [2022-11-23 01:58:56,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 01:58:56,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 01:58:56,611 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:58:56,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash -438564955, now seen corresponding path program 1 times [2022-11-23 01:58:56,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:56,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277319103] [2022-11-23 01:58:56,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:56,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:58:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:58:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:58:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:58:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:58:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:58:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:58:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:58:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:58:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 01:58:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 01:58:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-23 01:58:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-23 01:58:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 01:58:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-23 01:58:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-23 01:58:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:58:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-23 01:58:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-23 01:58:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-11-23 01:58:57,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:58:57,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277319103] [2022-11-23 01:58:57,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277319103] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:58:57,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699850962] [2022-11-23 01:58:57,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:57,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:58:57,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:58:57,595 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:58:57,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 01:58:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:58:57,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-23 01:58:57,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:58:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-11-23 01:58:58,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 01:58:58,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699850962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:58:58,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 01:58:58,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 13 [2022-11-23 01:58:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003608441] [2022-11-23 01:58:58,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:58:58,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 01:58:58,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:58:58,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 01:58:58,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-23 01:58:58,419 INFO L87 Difference]: Start difference. First operand 635 states and 818 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 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-23 01:58:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:58:59,433 INFO L93 Difference]: Finished difference Result 1307 states and 1780 transitions. [2022-11-23 01:58:59,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 01:58:59,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 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 158 [2022-11-23 01:58:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:58:59,440 INFO L225 Difference]: With dead ends: 1307 [2022-11-23 01:58:59,440 INFO L226 Difference]: Without dead ends: 804 [2022-11-23 01:58:59,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-11-23 01:58:59,444 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 39 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 01:58:59,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 949 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 01:58:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-11-23 01:58:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 666. [2022-11-23 01:58:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 473 states have (on average 1.2029598308668077) internal successors, (569), 486 states have internal predecessors, (569), 130 states have call successors, (130), 50 states have call predecessors, (130), 62 states have return successors, (167), 129 states have call predecessors, (167), 124 states have call successors, (167) [2022-11-23 01:58:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 866 transitions. [2022-11-23 01:58:59,639 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 866 transitions. Word has length 158 [2022-11-23 01:58:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:58:59,639 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 866 transitions. [2022-11-23 01:58:59,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 8 states have internal predecessors, (84), 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-23 01:58:59,640 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 866 transitions. [2022-11-23 01:58:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-23 01:58:59,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:58:59,643 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, 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-23 01:58:59,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 01:58:59,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:58:59,851 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:58:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:58:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1128192995, now seen corresponding path program 1 times [2022-11-23 01:58:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:58:59,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211093085] [2022-11-23 01:58:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:58:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:58:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 01:59:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 01:59:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:59:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:59:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 01:59:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 01:59:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:59:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 01:59:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 01:59:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 01:59:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 01:59:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-23 01:59:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-23 01:59:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 01:59:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-23 01:59:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-23 01:59:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 01:59:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-23 01:59:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-23 01:59:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2022-11-23 01:59:00,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:00,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211093085] [2022-11-23 01:59:00,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211093085] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 01:59:00,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774591922] [2022-11-23 01:59:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:00,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 01:59:00,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:59:00,398 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 01:59:00,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 01:59:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:00,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-23 01:59:00,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 01:59:00,867 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 01:59:00,868 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-23 01:59:00,887 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 01:59:00,889 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-23 01:59:03,181 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= (+ |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| 16) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|))))) is different from true [2022-11-23 01:59:05,388 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_44| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_44|) 0) 16))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_44| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_44| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_44|) 0))))) is different from true [2022-11-23 01:59:07,526 WARN L859 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42| Int)) (not (= 16 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42|) 0))))) is different from true [2022-11-23 01:59:17,630 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 01:59:31,815 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 01:59:41,929 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 01:59:50,079 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:00:00,267 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:00:08,406 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:00:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 154 proven. 20 refuted. 0 times theorem prover too weak. 57 trivial. 7 not checked. [2022-11-23 02:00:08,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:00:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-11-23 02:00:12,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774591922] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:00:12,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:00:12,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21, 14] total 38 [2022-11-23 02:00:12,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977902799] [2022-11-23 02:00:12,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:00:12,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 02:00:12,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:00:12,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 02:00:12,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1066, Unknown=10, NotChecked=204, Total=1406 [2022-11-23 02:00:12,109 INFO L87 Difference]: Start difference. First operand 666 states and 866 transitions. Second operand has 38 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 16 states have call successors, (39), 5 states have call predecessors, (39), 10 states have return successors, (39), 14 states have call predecessors, (39), 16 states have call successors, (39) [2022-11-23 02:00:14,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:16,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:18,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:20,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:22,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:24,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:26,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:28,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:30,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:32,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:34,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:41,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:43,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:45,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:47,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:49,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:55,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:00:57,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:01:09,843 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:01:19,933 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:01:38,145 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:01:46,230 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:02:02,438 WARN L233 SmtUtils]: Spent 16.09s on a formula simplification. DAG size of input: 46 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:02:10,511 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:02:26,658 WARN L233 SmtUtils]: Spent 16.10s on a formula simplification. DAG size of input: 52 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:02:28,729 WARN L859 $PredicateComparison]: unable to prove that (and (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| Int)) (not (= (+ |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8| 16) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_8|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_8|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42| Int)) (not (= 16 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42|) 0)))) (exists ((|v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_back_~list#1.base_BEFORE_CALL_42|) 0)))))) is different from true [2022-11-23 02:02:44,999 WARN L233 SmtUtils]: Spent 16.11s on a formula simplification. DAG size of input: 54 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:03:01,167 WARN L233 SmtUtils]: Spent 16.10s on a formula simplification. DAG size of input: 56 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:03:17,357 WARN L233 SmtUtils]: Spent 16.12s on a formula simplification. DAG size of input: 56 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:03:34,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:03:42,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:03:44,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:03:46,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:03:48,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:03:56,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:04:00,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:04:02,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:04:14,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:04:16,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:04:18,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:04:20,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:04:25,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:04:27,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:04:29,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:04:31,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:04:55,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:04:57,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:05:13,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:05:15,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:05:23,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:05:25,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:05:29,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:05:33,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:05:35,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:05:40,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:05:42,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:05:44,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 02:05:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:05:45,431 INFO L93 Difference]: Finished difference Result 1503 states and 1999 transitions. [2022-11-23 02:05:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-23 02:05:45,432 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 16 states have call successors, (39), 5 states have call predecessors, (39), 10 states have return successors, (39), 14 states have call predecessors, (39), 16 states have call successors, (39) Word has length 158 [2022-11-23 02:05:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:05:45,440 INFO L225 Difference]: With dead ends: 1503 [2022-11-23 02:05:45,440 INFO L226 Difference]: Without dead ends: 943 [2022-11-23 02:05:45,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 333 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 307.1s TimeCoverageRelationStatistics Valid=729, Invalid=4920, Unknown=67, NotChecked=604, Total=6320 [2022-11-23 02:05:45,445 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 401 mSDsluCounter, 3117 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 147 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 3302 SdHoareTripleChecker+Invalid, 3473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 903 IncrementalHoareTripleChecker+Unchecked, 95.6s IncrementalHoareTripleChecker+Time [2022-11-23 02:05:45,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 3302 Invalid, 3473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2377 Invalid, 46 Unknown, 903 Unchecked, 95.6s Time] [2022-11-23 02:05:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2022-11-23 02:05:45,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 793. [2022-11-23 02:05:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 585 states have (on average 1.2085470085470085) internal successors, (707), 593 states have internal predecessors, (707), 138 states have call successors, (138), 61 states have call predecessors, (138), 69 states have return successors, (180), 138 states have call predecessors, (180), 132 states have call successors, (180) [2022-11-23 02:05:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1025 transitions. [2022-11-23 02:05:45,680 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1025 transitions. Word has length 158 [2022-11-23 02:05:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:05:45,681 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1025 transitions. [2022-11-23 02:05:45,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 16 states have call successors, (39), 5 states have call predecessors, (39), 10 states have return successors, (39), 14 states have call predecessors, (39), 16 states have call successors, (39) [2022-11-23 02:05:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1025 transitions. [2022-11-23 02:05:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-23 02:05:45,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:05:45,685 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, 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-23 02:05:45,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 02:05:45,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 02:05:45,895 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:05:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:05:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash 611292156, now seen corresponding path program 2 times [2022-11-23 02:05:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:05:45,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388912986] [2022-11-23 02:05:45,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:05:45,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:05:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:05:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 02:05:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 02:05:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:05:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-23 02:05:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-23 02:05:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:05:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 02:05:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 02:05:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:05:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:05:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-23 02:05:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:46,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-23 02:05:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:47,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:05:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:47,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:05:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:47,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-23 02:05:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:47,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-23 02:05:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:05:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:47,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-23 02:05:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-23 02:05:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:05:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-11-23 02:05:47,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:05:47,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388912986] [2022-11-23 02:05:47,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388912986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:05:47,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135079353] [2022-11-23 02:05:47,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:05:47,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:05:47,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:05:47,297 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:05:47,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 02:05:47,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:05:47,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:05:47,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-23 02:05:47,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:05:47,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:05:47,735 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 18 treesize of output 19 [2022-11-23 02:05:47,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:05:47,742 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 16 treesize of output 17 [2022-11-23 02:06:13,008 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:06:13,339 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:06:13,340 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 22 [2022-11-23 02:06:13,347 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-23 02:06:13,347 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 25 treesize of output 1 [2022-11-23 02:06:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 189 proven. 8 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-23 02:06:13,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:06:14,168 INFO L321 Elim1Store]: treesize reduction 17, result has 63.0 percent of original size [2022-11-23 02:06:14,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 98 [2022-11-23 02:06:14,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:06:14,188 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 98 treesize of output 114 [2022-11-23 02:06:14,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-11-23 02:06:14,258 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-23 02:06:14,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-23 02:06:14,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:06:14,297 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 25 treesize of output 29 [2022-11-23 02:06:14,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:06:14,354 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 59 treesize of output 61 [2022-11-23 02:06:14,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:06:14,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:06:14,402 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:06:14,402 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 20 treesize of output 1 [2022-11-23 02:06:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-11-23 02:06:14,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135079353] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:06:14,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:06:14,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 37 [2022-11-23 02:06:14,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301651172] [2022-11-23 02:06:14,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:06:14,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-23 02:06:14,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:06:14,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-23 02:06:14,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1202, Unknown=7, NotChecked=0, Total=1332 [2022-11-23 02:06:14,508 INFO L87 Difference]: Start difference. First operand 793 states and 1025 transitions. Second operand has 37 states, 36 states have (on average 5.333333333333333) internal successors, (192), 36 states have internal predecessors, (192), 21 states have call successors, (49), 4 states have call predecessors, (49), 8 states have return successors, (48), 20 states have call predecessors, (48), 21 states have call successors, (48) [2022-11-23 02:06:34,821 WARN L233 SmtUtils]: Spent 20.08s on a formula simplification. DAG size of input: 46 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:06:56,290 WARN L233 SmtUtils]: Spent 20.09s on a formula simplification. DAG size of input: 55 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:07:06,919 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:07:17,081 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:07:27,161 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:07:37,348 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:07:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:07:39,514 INFO L93 Difference]: Finished difference Result 1484 states and 2085 transitions. [2022-11-23 02:07:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 02:07:39,519 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 5.333333333333333) internal successors, (192), 36 states have internal predecessors, (192), 21 states have call successors, (49), 4 states have call predecessors, (49), 8 states have return successors, (48), 20 states have call predecessors, (48), 21 states have call successors, (48) Word has length 169 [2022-11-23 02:07:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:07:39,524 INFO L225 Difference]: With dead ends: 1484 [2022-11-23 02:07:39,525 INFO L226 Difference]: Without dead ends: 831 [2022-11-23 02:07:39,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 357 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 106.9s TimeCoverageRelationStatistics Valid=414, Invalid=2885, Unknown=7, NotChecked=0, Total=3306 [2022-11-23 02:07:39,528 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 478 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 2993 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 3253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 2993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-23 02:07:39,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 3587 Invalid, 3253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 2993 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-23 02:07:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-11-23 02:07:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 656. [2022-11-23 02:07:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 472 states have (on average 1.2203389830508475) internal successors, (576), 482 states have internal predecessors, (576), 125 states have call successors, (125), 45 states have call predecessors, (125), 58 states have return successors, (189), 128 states have call predecessors, (189), 119 states have call successors, (189) [2022-11-23 02:07:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 890 transitions. [2022-11-23 02:07:39,699 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 890 transitions. Word has length 169 [2022-11-23 02:07:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:07:39,700 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 890 transitions. [2022-11-23 02:07:39,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 5.333333333333333) internal successors, (192), 36 states have internal predecessors, (192), 21 states have call successors, (49), 4 states have call predecessors, (49), 8 states have return successors, (48), 20 states have call predecessors, (48), 21 states have call successors, (48) [2022-11-23 02:07:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 890 transitions. [2022-11-23 02:07:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-23 02:07:39,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:07:39,703 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:07:39,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-23 02:07:39,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 02:07:39,910 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 02:07:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:07:39,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2093531135, now seen corresponding path program 1 times [2022-11-23 02:07:39,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:07:39,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182876126] [2022-11-23 02:07:39,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:07:39,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:07:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 02:07:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 02:07:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-23 02:07:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:07:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-23 02:07:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-23 02:07:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:07:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-23 02:07:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-23 02:07:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:07:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:07:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-23 02:07:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-23 02:07:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-23 02:07:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-23 02:07:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 02:07:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-23 02:07:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-23 02:07:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 02:07:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-23 02:07:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-23 02:07:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 54 proven. 8 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2022-11-23 02:07:40,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:07:40,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182876126] [2022-11-23 02:07:40,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182876126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:07:40,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076657823] [2022-11-23 02:07:40,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:07:40,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:07:40,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:07:40,487 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:07:40,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dd07ab1-5a2e-43ac-b58f-2b6cc7661f46/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-23 02:07:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:07:40,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 145 conjunts are in the unsatisfiable core [2022-11-23 02:07:40,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:07:40,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:07:41,155 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:07:41,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:07:41,172 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-23 02:07:41,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 02:07:41,197 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-23 02:07:41,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-23 02:07:41,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:07:41,309 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 02:07:41,310 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 46 [2022-11-23 02:07:41,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:07:41,331 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-23 02:07:41,332 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 54 [2022-11-23 02:07:41,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:07:41,357 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 02:07:41,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 46 [2022-11-23 02:07:41,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:07:41,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:07:41,387 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-23 02:07:41,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-11-23 02:07:41,547 INFO L321 Elim1Store]: treesize reduction 117, result has 14.6 percent of original size [2022-11-23 02:07:41,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 223 treesize of output 219 [2022-11-23 02:07:41,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:07:41,557 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 261 treesize of output 233 [2022-11-23 02:07:41,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:07:41,587 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2022-11-23 02:07:41,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 284 treesize of output 191 [2022-11-23 02:07:41,597 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-23 02:07:41,623 INFO L321 Elim1Store]: treesize reduction 76, result has 10.6 percent of original size [2022-11-23 02:07:41,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 152 treesize of output 69 [2022-11-23 02:07:41,638 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-23 02:07:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 45 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-23 02:07:45,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:07:45,913 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1572 Int) (v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1573 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_1568) |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_1566) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_1573)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16))))) (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_1572))) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_pop_back_harness_~#list~0#1.offset|))) 0))) is different from false [2022-11-23 02:07:45,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:07:45,956 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 112 treesize of output 111 [2022-11-23 02:07:46,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:07:46,194 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 142 treesize of output 119 [2022-11-23 02:07:46,908 INFO L321 Elim1Store]: treesize reduction 130, result has 73.0 percent of original size [2022-11-23 02:07:46,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 152762 treesize of output 132749 [2022-11-23 02:07:47,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:07:47,811 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 132362 treesize of output 125523 [2022-11-23 02:07:48,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:07:48,668 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 938751 treesize of output 916517 [2022-11-23 02:07:52,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:07:52,717 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 1031183 treesize of output 1000373 [2022-11-23 02:08:00,347 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 1057702 treesize of output 1042294 [2022-11-23 02:08:05,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:08:05,351 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 1384369 treesize of output 1363438 [2022-11-23 02:08:48,425 WARN L233 SmtUtils]: Spent 43.07s on a formula simplification. DAG size of input: 2248 DAG size of output: 2248 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-23 02:08:49,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:08:49,614 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 1491920 treesize of output 1466329 [2022-11-23 02:09:02,151 WARN L233 SmtUtils]: Spent 12.53s on a formula simplification. DAG size of input: 2345 DAG size of output: 2344 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-23 02:09:02,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:09:02,852 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 1465874 treesize of output 1462805 [2022-11-23 02:09:09,467 WARN L233 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 2388 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-23 02:09:21,667 WARN L233 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 2039 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)