./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc --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 caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:58:02,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:58:02,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:58:02,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:58:02,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:58:02,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:58:02,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:58:02,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:58:02,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:58:02,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:58:02,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:58:02,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:58:02,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:58:02,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:58:02,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:58:02,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:58:02,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:58:02,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:58:02,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:58:02,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:58:02,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:58:02,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:58:02,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:58:02,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:58:02,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:58:02,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:58:02,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:58:02,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:58:02,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:58:02,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:58:02,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:58:02,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:58:02,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:58:02,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:58:02,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:58:02,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:58:02,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:58:02,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:58:02,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:58:02,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:58:02,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:58:02,569 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:58:02,610 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:58:02,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:58:02,611 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:58:02,611 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:58:02,612 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:58:02,612 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:58:02,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:58:02,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:58:02,613 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:58:02,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:58:02,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:58:02,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:58:02,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:58:02,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:58:02,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:58:02,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:58:02,615 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:58:02,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:58:02,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:58:02,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:58:02,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:58:02,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:58:02,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:58:02,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:58:02,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:58:02,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:58:02,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:58:02,617 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:58:02,617 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:58:02,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:58:02,619 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/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_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc 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 -> caa9ea3c4b01be424b9d4542ff8acdcb39307db8022d65ba85a629a6a4ef591a [2022-11-02 20:58:02,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:58:02,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:58:02,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:58:02,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:58:02,926 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:58:02,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2022-11-02 20:58:03,040 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/data/e8a29c94c/66ea8802bfb941d7bd9945230c6eff94/FLAG189bf915b [2022-11-02 20:58:03,844 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:58:03,845 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i [2022-11-02 20:58:03,889 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/data/e8a29c94c/66ea8802bfb941d7bd9945230c6eff94/FLAG189bf915b [2022-11-02 20:58:04,382 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/data/e8a29c94c/66ea8802bfb941d7bd9945230c6eff94 [2022-11-02 20:58:04,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:58:04,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:58:04,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:58:04,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:58:04,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:58:04,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:58:04" (1/1) ... [2022-11-02 20:58:04,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf6025d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:04, skipping insertion in model container [2022-11-02 20:58:04,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:58:04" (1/1) ... [2022-11-02 20:58:04,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:58:04,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:58:04,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4499,4512] [2022-11-02 20:58:04,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4559,4572] [2022-11-02 20:58:05,932 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:05,937 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:05,939 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:05,940 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:05,946 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:05,971 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:05,972 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:05,976 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:05,977 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:06,380 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-02 20:58:06,382 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-02 20:58:06,383 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-02 20:58:06,384 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-02 20:58:06,389 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-02 20:58:06,394 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-02 20:58:06,395 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-02 20:58:06,396 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-02 20:58:06,398 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-02 20:58:06,402 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-02 20:58:06,561 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-02 20:58:06,686 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:06,687 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:06,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:58:06,934 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:58:06,962 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4499,4512] [2022-11-02 20:58:06,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_cursor_harness.i[4559,4572] [2022-11-02 20:58:07,008 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:07,009 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:07,009 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:07,009 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:07,010 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:07,015 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:07,016 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:07,017 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:07,017 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:07,045 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-02 20:58:07,045 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-02 20:58:07,046 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-02 20:58:07,047 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-02 20:58:07,047 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-02 20:58:07,048 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-02 20:58:07,048 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-02 20:58:07,049 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-02 20:58:07,049 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-02 20:58:07,049 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-02 20:58:07,072 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-02 20:58:07,145 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:07,147 WARN L1543 CHandler]: Possible shadowing of function index [2022-11-02 20:58:07,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:58:07,462 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:58:07,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07 WrapperNode [2022-11-02 20:58:07,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:58:07,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:58:07,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:58:07,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:58:07,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07" (1/1) ... [2022-11-02 20:58:07,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07" (1/1) ... [2022-11-02 20:58:07,682 INFO L138 Inliner]: procedures = 693, calls = 2789, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 869 [2022-11-02 20:58:07,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:58:07,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:58:07,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:58:07,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:58:07,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07" (1/1) ... [2022-11-02 20:58:07,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07" (1/1) ... [2022-11-02 20:58:07,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07" (1/1) ... [2022-11-02 20:58:07,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07" (1/1) ... [2022-11-02 20:58:07,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07" (1/1) ... [2022-11-02 20:58:07,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07" (1/1) ... [2022-11-02 20:58:07,788 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07" (1/1) ... [2022-11-02 20:58:07,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07" (1/1) ... [2022-11-02 20:58:07,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:58:07,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:58:07,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:58:07,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:58:07,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07" (1/1) ... [2022-11-02 20:58:07,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:58:07,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:07,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:58:07,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:58:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-11-02 20:58:07,914 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-11-02 20:58:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-11-02 20:58:07,914 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-11-02 20:58:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-11-02 20:58:07,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-11-02 20:58:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-02 20:58:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:58:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-02 20:58:07,916 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-02 20:58:07,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:58:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-02 20:58:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-02 20:58:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:58:07,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:58:07,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:58:07,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:58:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:58:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-02 20:58:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-02 20:58:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:58:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:58:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:58:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:58:07,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:58:07,921 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-11-02 20:58:07,922 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-11-02 20:58:07,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:58:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-02 20:58:07,923 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-02 20:58:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-02 20:58:07,923 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-02 20:58:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:58:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:58:08,282 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:58:08,285 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:58:09,774 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:58:09,784 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:58:09,784 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:58:09,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:09 BoogieIcfgContainer [2022-11-02 20:58:09,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:58:09,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:58:09,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:58:09,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:58:09,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:58:04" (1/3) ... [2022-11-02 20:58:09,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4235f33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:58:09, skipping insertion in model container [2022-11-02 20:58:09,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:58:07" (2/3) ... [2022-11-02 20:58:09,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4235f33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:58:09, skipping insertion in model container [2022-11-02 20:58:09,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:09" (3/3) ... [2022-11-02 20:58:09,803 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_cursor_harness.i [2022-11-02 20:58:09,825 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:58:09,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:58:09,903 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:58:09,910 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;@5de0d1b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:58:09,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:58:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-02 20:58:09,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:58:09,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:09,933 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:58:09,933 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:09,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:09,941 INFO L85 PathProgramCache]: Analyzing trace with hash -386411024, now seen corresponding path program 1 times [2022-11-02 20:58:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:09,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962771844] [2022-11-02 20:58:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:58:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:58:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:58:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:58:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:58:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:58:11,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:11,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962771844] [2022-11-02 20:58:11,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962771844] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:11,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739272974] [2022-11-02 20:58:11,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:11,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:11,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:11,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:11,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:58:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:11,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-02 20:58:11,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:58:11,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:58:11,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739272974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:11,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:58:11,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2022-11-02 20:58:11,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239714509] [2022-11-02 20:58:11,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:11,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:58:11,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:11,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:58:11,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:58:11,927 INFO L87 Difference]: Start difference. First operand has 125 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:58:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:11,980 INFO L93 Difference]: Finished difference Result 241 states and 335 transitions. [2022-11-02 20:58:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:58:11,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-11-02 20:58:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:11,991 INFO L225 Difference]: With dead ends: 241 [2022-11-02 20:58:11,991 INFO L226 Difference]: Without dead ends: 120 [2022-11-02 20:58:11,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:58:11,999 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:12,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-02 20:58:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-02 20:58:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 80 states have (on average 1.275) internal successors, (102), 81 states have internal predecessors, (102), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-02 20:58:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 159 transitions. [2022-11-02 20:58:12,051 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 159 transitions. Word has length 61 [2022-11-02 20:58:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:12,052 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 159 transitions. [2022-11-02 20:58:12,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:58:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 159 transitions. [2022-11-02 20:58:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:58:12,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:12,056 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:58:12,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:12,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-02 20:58:12,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:12,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1156835566, now seen corresponding path program 1 times [2022-11-02 20:58:12,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:12,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664668492] [2022-11-02 20:58:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:12,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:12,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:12,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:58:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:12,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:58:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:12,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:58:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:12,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:58:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:12,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:58:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:58:12,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:12,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664668492] [2022-11-02 20:58:12,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664668492] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:12,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107069104] [2022-11-02 20:58:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:12,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:12,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:12,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:12,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:58:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:13,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:58:13,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:58:13,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 20:58:13,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107069104] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:13,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:58:13,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 13 [2022-11-02 20:58:13,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454490192] [2022-11-02 20:58:13,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:13,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:58:13,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:13,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:58:13,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:58:13,797 INFO L87 Difference]: Start difference. First operand 120 states and 159 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:58:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:14,119 INFO L93 Difference]: Finished difference Result 208 states and 282 transitions. [2022-11-02 20:58:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:58:14,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2022-11-02 20:58:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:14,122 INFO L225 Difference]: With dead ends: 208 [2022-11-02 20:58:14,122 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 20:58:14,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:58:14,124 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 241 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:14,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 535 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:58:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 20:58:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2022-11-02 20:58:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-02 20:58:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 177 transitions. [2022-11-02 20:58:14,145 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 177 transitions. Word has length 61 [2022-11-02 20:58:14,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:14,145 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 177 transitions. [2022-11-02 20:58:14,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:58:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2022-11-02 20:58:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-02 20:58:14,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:14,148 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:58:14,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:14,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:14,365 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:14,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1751928336, now seen corresponding path program 1 times [2022-11-02 20:58:14,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:14,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487565360] [2022-11-02 20:58:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:14,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:58:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:58:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:58:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:58:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:58:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:58:14,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:14,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487565360] [2022-11-02 20:58:14,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487565360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:14,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942457518] [2022-11-02 20:58:14,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:14,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:14,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:14,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:14,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:58:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:15,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:58:15,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:58:15,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:58:15,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942457518] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:15,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:15,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-11-02 20:58:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838443483] [2022-11-02 20:58:15,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:15,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:58:15,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:15,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:58:15,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:58:15,651 INFO L87 Difference]: Start difference. First operand 132 states and 177 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2022-11-02 20:58:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:15,896 INFO L93 Difference]: Finished difference Result 230 states and 312 transitions. [2022-11-02 20:58:15,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:58:15,897 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) Word has length 61 [2022-11-02 20:58:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:15,905 INFO L225 Difference]: With dead ends: 230 [2022-11-02 20:58:15,905 INFO L226 Difference]: Without dead ends: 135 [2022-11-02 20:58:15,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:58:15,907 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 336 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:15,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 584 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:58:15,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-02 20:58:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-11-02 20:58:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 92 states have internal predecessors, (114), 33 states have call successors, (33), 10 states have call predecessors, (33), 11 states have return successors, (34), 32 states have call predecessors, (34), 32 states have call successors, (34) [2022-11-02 20:58:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2022-11-02 20:58:15,943 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 61 [2022-11-02 20:58:15,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:15,943 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2022-11-02 20:58:15,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 7 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (19), 7 states have call predecessors, (19), 7 states have call successors, (19) [2022-11-02 20:58:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2022-11-02 20:58:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:58:15,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:15,955 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-11-02 20:58:15,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:16,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:16,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:16,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:16,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1531369667, now seen corresponding path program 1 times [2022-11-02 20:58:16,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:16,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715334139] [2022-11-02 20:58:16,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:16,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:16,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:58:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:16,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:58:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:16,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:58:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:16,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:58:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:16,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:58:16,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:16,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715334139] [2022-11-02 20:58:16,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715334139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:16,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:16,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:58:16,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895669694] [2022-11-02 20:58:16,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:16,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:58:16,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:16,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:58:16,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:58:16,770 INFO L87 Difference]: Start difference. First operand 135 states and 181 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:58:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:16,815 INFO L93 Difference]: Finished difference Result 233 states and 317 transitions. [2022-11-02 20:58:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:58:16,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 65 [2022-11-02 20:58:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:16,821 INFO L225 Difference]: With dead ends: 233 [2022-11-02 20:58:16,821 INFO L226 Difference]: Without dead ends: 179 [2022-11-02 20:58:16,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:58:16,824 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 12 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:16,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 481 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-02 20:58:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-11-02 20:58:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 118 states have (on average 1.271186440677966) internal successors, (150), 120 states have internal predecessors, (150), 47 states have call successors, (47), 10 states have call predecessors, (47), 11 states have return successors, (50), 46 states have call predecessors, (50), 46 states have call successors, (50) [2022-11-02 20:58:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2022-11-02 20:58:16,871 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 247 transitions. Word has length 65 [2022-11-02 20:58:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:16,872 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 247 transitions. [2022-11-02 20:58:16,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:58:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 247 transitions. [2022-11-02 20:58:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:58:16,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:16,881 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:58:16,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:58:16,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:16,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash -84293126, now seen corresponding path program 1 times [2022-11-02 20:58:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:16,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124804108] [2022-11-02 20:58:16,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:16,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:17,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:17,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:17,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:17,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:58:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:17,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:58:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:17,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:58:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:17,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:58:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:58:17,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:17,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124804108] [2022-11-02 20:58:17,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124804108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:17,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:17,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:58:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64767458] [2022-11-02 20:58:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:17,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:58:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:17,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:58:17,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:58:17,923 INFO L87 Difference]: Start difference. First operand 177 states and 247 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-02 20:58:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:18,017 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2022-11-02 20:58:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:58:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 65 [2022-11-02 20:58:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:18,021 INFO L225 Difference]: With dead ends: 188 [2022-11-02 20:58:18,021 INFO L226 Difference]: Without dead ends: 181 [2022-11-02 20:58:18,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:58:18,023 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 16 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:18,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1070 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-02 20:58:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-11-02 20:58:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 124 states have internal predecessors, (153), 47 states have call successors, (47), 10 states have call predecessors, (47), 12 states have return successors, (56), 46 states have call predecessors, (56), 46 states have call successors, (56) [2022-11-02 20:58:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2022-11-02 20:58:18,056 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 65 [2022-11-02 20:58:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:18,058 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2022-11-02 20:58:18,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-02 20:58:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2022-11-02 20:58:18,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 20:58:18,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:18,060 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:18,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:58:18,061 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:18,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:18,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1359362750, now seen corresponding path program 1 times [2022-11-02 20:58:18,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:18,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270577351] [2022-11-02 20:58:18,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:18,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:19,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:19,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:19,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:19,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:58:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:19,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:58:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:19,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:58:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:58:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-02 20:58:19,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:19,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270577351] [2022-11-02 20:58:19,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270577351] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:19,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842711799] [2022-11-02 20:58:19,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:19,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:19,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:19,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:19,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:58:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:20,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 2507 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:58:20,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:58:21,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:21,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-02 20:58:21,579 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 20:58:21,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2022-11-02 20:58:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:58:21,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842711799] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:21,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:21,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2022-11-02 20:58:21,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866085084] [2022-11-02 20:58:21,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:21,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:58:21,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:58:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:58:21,602 INFO L87 Difference]: Start difference. First operand 181 states and 256 transitions. Second operand has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-02 20:58:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:22,566 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2022-11-02 20:58:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:58:22,567 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 69 [2022-11-02 20:58:22,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:22,569 INFO L225 Difference]: With dead ends: 334 [2022-11-02 20:58:22,570 INFO L226 Difference]: Without dead ends: 306 [2022-11-02 20:58:22,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 133 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:58:22,571 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 96 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:22,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1856 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 383 Invalid, 0 Unknown, 141 Unchecked, 0.5s Time] [2022-11-02 20:58:22,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-02 20:58:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 270. [2022-11-02 20:58:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 184 states have (on average 1.2934782608695652) internal successors, (238), 188 states have internal predecessors, (238), 71 states have call successors, (71), 12 states have call predecessors, (71), 14 states have return successors, (82), 69 states have call predecessors, (82), 70 states have call successors, (82) [2022-11-02 20:58:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 391 transitions. [2022-11-02 20:58:22,620 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 391 transitions. Word has length 69 [2022-11-02 20:58:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:22,622 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 391 transitions. [2022-11-02 20:58:22,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.277777777777778) internal successors, (77), 18 states have internal predecessors, (77), 5 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-02 20:58:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 391 transitions. [2022-11-02 20:58:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-02 20:58:22,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:22,629 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-11-02 20:58:22,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:22,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:22,842 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:22,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:22,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1404727030, now seen corresponding path program 1 times [2022-11-02 20:58:22,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:22,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585028023] [2022-11-02 20:58:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:23,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:23,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:23,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:23,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:58:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:58:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:23,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:58:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:23,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:58:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:23,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:58:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:58:23,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:23,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585028023] [2022-11-02 20:58:23,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585028023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:23,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997643395] [2022-11-02 20:58:23,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:23,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:23,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:23,850 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:23,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:58:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:24,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-02 20:58:24,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:58:24,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:58:24,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997643395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:24,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:58:24,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2022-11-02 20:58:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908203032] [2022-11-02 20:58:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:24,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:58:24,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:58:24,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:58:24,407 INFO L87 Difference]: Start difference. First operand 270 states and 391 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:58:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:24,578 INFO L93 Difference]: Finished difference Result 411 states and 598 transitions. [2022-11-02 20:58:24,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:58:24,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-11-02 20:58:24,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:24,581 INFO L225 Difference]: With dead ends: 411 [2022-11-02 20:58:24,581 INFO L226 Difference]: Without dead ends: 275 [2022-11-02 20:58:24,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:58:24,583 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:24,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1146 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:24,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-02 20:58:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-11-02 20:58:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 188 states have (on average 1.2872340425531914) internal successors, (242), 193 states have internal predecessors, (242), 71 states have call successors, (71), 12 states have call predecessors, (71), 15 states have return successors, (87), 69 states have call predecessors, (87), 70 states have call successors, (87) [2022-11-02 20:58:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 400 transitions. [2022-11-02 20:58:24,622 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 400 transitions. Word has length 73 [2022-11-02 20:58:24,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:24,623 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 400 transitions. [2022-11-02 20:58:24,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:58:24,623 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 400 transitions. [2022-11-02 20:58:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-02 20:58:24,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:24,627 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:58:24,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:24,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:24,844 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:24,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1686084061, now seen corresponding path program 1 times [2022-11-02 20:58:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:24,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634720848] [2022-11-02 20:58:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:24,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:25,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:25,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:25,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:25,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:58:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:58:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:25,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:58:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:25,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:58:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:25,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-02 20:58:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-02 20:58:25,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:25,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634720848] [2022-11-02 20:58:25,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634720848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:25,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:25,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:58:25,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909482045] [2022-11-02 20:58:25,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:25,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:58:25,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:25,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:58:25,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:58:25,370 INFO L87 Difference]: Start difference. First operand 275 states and 400 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:58:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:25,463 INFO L93 Difference]: Finished difference Result 397 states and 565 transitions. [2022-11-02 20:58:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:58:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 76 [2022-11-02 20:58:25,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:25,466 INFO L225 Difference]: With dead ends: 397 [2022-11-02 20:58:25,466 INFO L226 Difference]: Without dead ends: 296 [2022-11-02 20:58:25,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:58:25,467 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 35 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:25,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 688 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-02 20:58:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2022-11-02 20:58:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 183 states have (on average 1.2513661202185793) internal successors, (229), 188 states have internal predecessors, (229), 67 states have call successors, (67), 12 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2022-11-02 20:58:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2022-11-02 20:58:25,502 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 76 [2022-11-02 20:58:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:25,502 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2022-11-02 20:58:25,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:58:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2022-11-02 20:58:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-02 20:58:25,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:25,510 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:25,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:58:25,510 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:25,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1559219441, now seen corresponding path program 1 times [2022-11-02 20:58:25,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:25,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386227913] [2022-11-02 20:58:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:25,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:26,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:26,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:26,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:26,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:58:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:58:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:26,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:58:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:58:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:26,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:58:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-02 20:58:26,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:26,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386227913] [2022-11-02 20:58:26,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386227913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:26,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357940892] [2022-11-02 20:58:26,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:26,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:26,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:26,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:26,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:58:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:26,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:58:26,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-02 20:58:26,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:58:26,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357940892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:26,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:58:26,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-02 20:58:26,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515165432] [2022-11-02 20:58:26,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:26,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:58:26,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:26,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:58:26,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:58:26,982 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:58:27,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:27,207 INFO L93 Difference]: Finished difference Result 405 states and 571 transitions. [2022-11-02 20:58:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:58:27,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-11-02 20:58:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:27,210 INFO L225 Difference]: With dead ends: 405 [2022-11-02 20:58:27,210 INFO L226 Difference]: Without dead ends: 266 [2022-11-02 20:58:27,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:58:27,212 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 17 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:27,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 561 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-11-02 20:58:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-02 20:58:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-11-02 20:58:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 183 states have (on average 1.2459016393442623) internal successors, (228), 188 states have internal predecessors, (228), 67 states have call successors, (67), 12 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2022-11-02 20:58:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 372 transitions. [2022-11-02 20:58:27,238 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 372 transitions. Word has length 75 [2022-11-02 20:58:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:27,238 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 372 transitions. [2022-11-02 20:58:27,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:58:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 372 transitions. [2022-11-02 20:58:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-02 20:58:27,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:27,241 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:27,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:27,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-02 20:58:27,463 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:27,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1115318767, now seen corresponding path program 1 times [2022-11-02 20:58:27,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:27,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899609238] [2022-11-02 20:58:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:27,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:29,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:58:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:29,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:58:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:29,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:58:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:29,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:58:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:29,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:58:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:58:29,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:29,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899609238] [2022-11-02 20:58:29,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899609238] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:29,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792848404] [2022-11-02 20:58:29,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:29,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:29,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:29,417 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:29,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:58:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:29,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 2529 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-02 20:58:29,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:29,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:58:29,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:58:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:58:30,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:58:30,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792848404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:30,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:58:30,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-11-02 20:58:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468449637] [2022-11-02 20:58:30,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:30,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:58:30,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:30,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:58:30,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:58:30,503 INFO L87 Difference]: Start difference. First operand 266 states and 372 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:58:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:30,630 INFO L93 Difference]: Finished difference Result 422 states and 584 transitions. [2022-11-02 20:58:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:58:30,631 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2022-11-02 20:58:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:30,633 INFO L225 Difference]: With dead ends: 422 [2022-11-02 20:58:30,633 INFO L226 Difference]: Without dead ends: 273 [2022-11-02 20:58:30,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:58:30,635 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 46 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:30,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 704 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-11-02 20:58:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-02 20:58:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2022-11-02 20:58:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 187 states have (on average 1.2459893048128343) internal successors, (233), 191 states have internal predecessors, (233), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (77), 65 states have call predecessors, (77), 66 states have call successors, (77) [2022-11-02 20:58:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 377 transitions. [2022-11-02 20:58:30,665 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 377 transitions. Word has length 75 [2022-11-02 20:58:30,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:30,666 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 377 transitions. [2022-11-02 20:58:30,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:58:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 377 transitions. [2022-11-02 20:58:30,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-02 20:58:30,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:30,668 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:30,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:30,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:58:30,887 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:30,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:30,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1074644017, now seen corresponding path program 1 times [2022-11-02 20:58:30,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:30,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364450454] [2022-11-02 20:58:30,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:30,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:31,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:58:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:58:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:31,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-02 20:58:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:31,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:58:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:31,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 20:58:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-02 20:58:31,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:31,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364450454] [2022-11-02 20:58:31,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364450454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:31,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841720734] [2022-11-02 20:58:31,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:31,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:31,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:31,267 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:31,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:58:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:31,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:58:31,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-02 20:58:31,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:58:31,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841720734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:31,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:58:31,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-11-02 20:58:31,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788623880] [2022-11-02 20:58:31,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:31,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:58:31,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:31,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:58:31,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:58:31,761 INFO L87 Difference]: Start difference. First operand 270 states and 377 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:58:31,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:31,807 INFO L93 Difference]: Finished difference Result 414 states and 578 transitions. [2022-11-02 20:58:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:58:31,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-11-02 20:58:31,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:31,811 INFO L225 Difference]: With dead ends: 414 [2022-11-02 20:58:31,811 INFO L226 Difference]: Without dead ends: 274 [2022-11-02 20:58:31,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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-02 20:58:31,813 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 9 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:31,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 462 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-02 20:58:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2022-11-02 20:58:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 188 states have (on average 1.2393617021276595) internal successors, (233), 192 states have internal predecessors, (233), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (75), 65 states have call predecessors, (75), 66 states have call successors, (75) [2022-11-02 20:58:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 375 transitions. [2022-11-02 20:58:31,843 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 375 transitions. Word has length 75 [2022-11-02 20:58:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:31,844 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 375 transitions. [2022-11-02 20:58:31,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:58:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 375 transitions. [2022-11-02 20:58:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 20:58:31,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:31,846 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:58:31,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:32,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:58:32,066 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash -453034012, now seen corresponding path program 1 times [2022-11-02 20:58:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:32,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062375765] [2022-11-02 20:58:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:32,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:32,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:32,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:32,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:32,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:32,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:58:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:32,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:58:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:32,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:58:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:32,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:58:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:32,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:58:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:58:32,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:32,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062375765] [2022-11-02 20:58:32,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062375765] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:32,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347764846] [2022-11-02 20:58:32,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:32,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:32,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:32,887 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:32,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:58:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:33,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:58:33,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:58:33,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-02 20:58:33,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347764846] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:33,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:33,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2022-11-02 20:58:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144589541] [2022-11-02 20:58:33,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:33,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:58:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:33,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:58:33,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:58:33,712 INFO L87 Difference]: Start difference. First operand 271 states and 375 transitions. Second operand has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2022-11-02 20:58:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:34,271 INFO L93 Difference]: Finished difference Result 385 states and 522 transitions. [2022-11-02 20:58:34,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:58:34,272 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) Word has length 77 [2022-11-02 20:58:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:34,274 INFO L225 Difference]: With dead ends: 385 [2022-11-02 20:58:34,274 INFO L226 Difference]: Without dead ends: 292 [2022-11-02 20:58:34,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:58:34,276 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 406 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:34,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1241 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:58:34,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-02 20:58:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2022-11-02 20:58:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 186 states have (on average 1.2365591397849462) internal successors, (230), 189 states have internal predecessors, (230), 67 states have call successors, (67), 13 states have call predecessors, (67), 14 states have return successors, (73), 65 states have call predecessors, (73), 66 states have call successors, (73) [2022-11-02 20:58:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2022-11-02 20:58:34,306 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 77 [2022-11-02 20:58:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:34,307 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2022-11-02 20:58:34,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (26), 3 states have call predecessors, (26), 6 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2022-11-02 20:58:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2022-11-02 20:58:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-11-02 20:58:34,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:34,309 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:34,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:34,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:58:34,530 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:34,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:34,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1814152958, now seen corresponding path program 1 times [2022-11-02 20:58:34,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:34,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458404261] [2022-11-02 20:58:34,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:34,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:35,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:35,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:35,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:35,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:58:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:35,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:58:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:35,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:58:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:35,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:58:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:35,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:58:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:35,214 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-02 20:58:35,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:35,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458404261] [2022-11-02 20:58:35,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458404261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:35,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:35,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:58:35,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901294326] [2022-11-02 20:58:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:35,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:58:35,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:58:35,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:58:35,217 INFO L87 Difference]: Start difference. First operand 268 states and 370 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:58:35,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:35,279 INFO L93 Difference]: Finished difference Result 344 states and 465 transitions. [2022-11-02 20:58:35,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:58:35,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2022-11-02 20:58:35,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:35,282 INFO L225 Difference]: With dead ends: 344 [2022-11-02 20:58:35,282 INFO L226 Difference]: Without dead ends: 268 [2022-11-02 20:58:35,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:58:35,283 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 18 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:35,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 630 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:58:35,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-02 20:58:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 262. [2022-11-02 20:58:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 182 states have (on average 1.2087912087912087) internal successors, (220), 185 states have internal predecessors, (220), 65 states have call successors, (65), 13 states have call predecessors, (65), 14 states have return successors, (71), 63 states have call predecessors, (71), 64 states have call successors, (71) [2022-11-02 20:58:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 356 transitions. [2022-11-02 20:58:35,311 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 356 transitions. Word has length 78 [2022-11-02 20:58:35,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:35,311 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 356 transitions. [2022-11-02 20:58:35,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-02 20:58:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 356 transitions. [2022-11-02 20:58:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-11-02 20:58:35,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:35,313 INFO L195 NwaCegarLoop]: trace histogram [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-02 20:58:35,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:58:35,314 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:35,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:35,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1823272801, now seen corresponding path program 1 times [2022-11-02 20:58:35,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:35,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346434352] [2022-11-02 20:58:35,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:35,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 20:58:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:58:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:58:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 20:58:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-02 20:58:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:58:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-02 20:58:36,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:36,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346434352] [2022-11-02 20:58:36,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346434352] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:36,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899301390] [2022-11-02 20:58:36,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:36,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:36,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:36,743 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:36,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:58:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:37,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 2523 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 20:58:37,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:58:38,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:38,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-02 20:58:38,550 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 20:58:38,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2022-11-02 20:58:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:58:38,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899301390] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:58:38,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:58:38,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2022-11-02 20:58:38,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494963916] [2022-11-02 20:58:38,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:58:38,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:58:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:38,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:58:38,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:58:38,569 INFO L87 Difference]: Start difference. First operand 262 states and 356 transitions. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2022-11-02 20:58:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:39,674 INFO L93 Difference]: Finished difference Result 383 states and 526 transitions. [2022-11-02 20:58:39,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:58:39,675 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 79 [2022-11-02 20:58:39,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:39,677 INFO L225 Difference]: With dead ends: 383 [2022-11-02 20:58:39,677 INFO L226 Difference]: Without dead ends: 319 [2022-11-02 20:58:39,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 153 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:58:39,679 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 197 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:39,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1577 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 456 Invalid, 0 Unknown, 181 Unchecked, 0.6s Time] [2022-11-02 20:58:39,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-02 20:58:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 254. [2022-11-02 20:58:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 176 states have (on average 1.1931818181818181) internal successors, (210), 179 states have internal predecessors, (210), 62 states have call successors, (62), 14 states have call predecessors, (62), 15 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2022-11-02 20:58:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 339 transitions. [2022-11-02 20:58:39,707 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 339 transitions. Word has length 79 [2022-11-02 20:58:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:39,707 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 339 transitions. [2022-11-02 20:58:39,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2022-11-02 20:58:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 339 transitions. [2022-11-02 20:58:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-02 20:58:39,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:39,709 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:39,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:39,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:58:39,930 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:39,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:39,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1762517655, now seen corresponding path program 1 times [2022-11-02 20:58:39,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:39,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358657575] [2022-11-02 20:58:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:39,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:58:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:58:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:58:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:58:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:58:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:58:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:58:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 20:58:41,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:41,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358657575] [2022-11-02 20:58:41,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358657575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:41,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:41,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:58:41,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396482326] [2022-11-02 20:58:41,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:41,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:58:41,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:58:41,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:58:41,684 INFO L87 Difference]: Start difference. First operand 254 states and 339 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:58:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:42,631 INFO L93 Difference]: Finished difference Result 320 states and 431 transitions. [2022-11-02 20:58:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:58:42,632 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2022-11-02 20:58:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:42,634 INFO L225 Difference]: With dead ends: 320 [2022-11-02 20:58:42,634 INFO L226 Difference]: Without dead ends: 313 [2022-11-02 20:58:42,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:58:42,635 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 160 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:42,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 745 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:58:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-02 20:58:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 259. [2022-11-02 20:58:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 180 states have (on average 1.1888888888888889) internal successors, (214), 184 states have internal predecessors, (214), 62 states have call successors, (62), 14 states have call predecessors, (62), 16 states have return successors, (69), 60 states have call predecessors, (69), 60 states have call successors, (69) [2022-11-02 20:58:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 345 transitions. [2022-11-02 20:58:42,678 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 345 transitions. Word has length 86 [2022-11-02 20:58:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:42,678 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 345 transitions. [2022-11-02 20:58:42,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:58:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 345 transitions. [2022-11-02 20:58:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-02 20:58:42,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:42,681 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:42,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:58:42,681 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:42,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:42,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1504352217, now seen corresponding path program 1 times [2022-11-02 20:58:42,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:42,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316886638] [2022-11-02 20:58:42,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:42,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:58:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:58:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:58:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:58:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:58:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:58:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:58:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-02 20:58:43,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:43,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316886638] [2022-11-02 20:58:43,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316886638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:43,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:43,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:58:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581849184] [2022-11-02 20:58:43,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:43,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:58:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:43,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:58:43,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:58:43,413 INFO L87 Difference]: Start difference. First operand 259 states and 345 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-02 20:58:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:43,773 INFO L93 Difference]: Finished difference Result 378 states and 492 transitions. [2022-11-02 20:58:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:58:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 86 [2022-11-02 20:58:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:43,775 INFO L225 Difference]: With dead ends: 378 [2022-11-02 20:58:43,775 INFO L226 Difference]: Without dead ends: 252 [2022-11-02 20:58:43,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:58:43,776 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 55 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:43,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 358 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:58:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-02 20:58:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2022-11-02 20:58:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 172 states have (on average 1.186046511627907) internal successors, (204), 175 states have internal predecessors, (204), 62 states have call successors, (62), 14 states have call predecessors, (62), 15 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2022-11-02 20:58:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 332 transitions. [2022-11-02 20:58:43,804 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 332 transitions. Word has length 86 [2022-11-02 20:58:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:43,805 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 332 transitions. [2022-11-02 20:58:43,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-02 20:58:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 332 transitions. [2022-11-02 20:58:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-02 20:58:43,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:43,807 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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-02 20:58:43,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:58:43,807 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:43,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash 858492976, now seen corresponding path program 1 times [2022-11-02 20:58:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:43,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748614786] [2022-11-02 20:58:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:44,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:44,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:44,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:58:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:44,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:58:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:44,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:58:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:44,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-02 20:58:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:44,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:58:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:44,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:58:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:44,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:58:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-02 20:58:45,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:45,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748614786] [2022-11-02 20:58:45,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748614786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:45,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:45,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:58:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874176010] [2022-11-02 20:58:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:45,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:58:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:45,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:58:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:58:45,137 INFO L87 Difference]: Start difference. First operand 250 states and 332 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-02 20:58:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:46,069 INFO L93 Difference]: Finished difference Result 260 states and 341 transitions. [2022-11-02 20:58:46,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:58:46,070 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 88 [2022-11-02 20:58:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:46,071 INFO L225 Difference]: With dead ends: 260 [2022-11-02 20:58:46,071 INFO L226 Difference]: Without dead ends: 213 [2022-11-02 20:58:46,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:58:46,072 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 76 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:46,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1032 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:58:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-02 20:58:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 183. [2022-11-02 20:58:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 127 states have (on average 1.1653543307086613) internal successors, (148), 131 states have internal predecessors, (148), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2022-11-02 20:58:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 231 transitions. [2022-11-02 20:58:46,098 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 231 transitions. Word has length 88 [2022-11-02 20:58:46,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:46,099 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 231 transitions. [2022-11-02 20:58:46,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-02 20:58:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 231 transitions. [2022-11-02 20:58:46,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-02 20:58:46,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:46,101 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:58:46,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:58:46,101 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:46,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1641071482, now seen corresponding path program 1 times [2022-11-02 20:58:46,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:46,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838501534] [2022-11-02 20:58:46,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:46,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:46,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:46,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:58:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:46,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:46,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:58:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:58:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:47,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:47,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:47,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:58:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:47,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:58:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:47,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:58:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:47,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:58:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:47,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:58:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:47,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:58:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:47,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:58:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 20:58:47,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:47,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838501534] [2022-11-02 20:58:47,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838501534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:47,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507247584] [2022-11-02 20:58:47,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:47,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:47,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:47,287 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:47,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:58:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:47,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 2646 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-02 20:58:47,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-02 20:58:47,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:58:47,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507247584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:47,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:58:47,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2022-11-02 20:58:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91067175] [2022-11-02 20:58:47,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:47,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:58:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:47,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:58:47,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:58:47,954 INFO L87 Difference]: Start difference. First operand 183 states and 231 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-11-02 20:58:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:48,184 INFO L93 Difference]: Finished difference Result 219 states and 271 transitions. [2022-11-02 20:58:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:58:48,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) Word has length 99 [2022-11-02 20:58:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:48,186 INFO L225 Difference]: With dead ends: 219 [2022-11-02 20:58:48,187 INFO L226 Difference]: Without dead ends: 183 [2022-11-02 20:58:48,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:58:48,188 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 50 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:48,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1198 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:58:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-02 20:58:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-02 20:58:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 127 states have (on average 1.1574803149606299) internal successors, (147), 131 states have internal predecessors, (147), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2022-11-02 20:58:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2022-11-02 20:58:48,214 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 99 [2022-11-02 20:58:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:48,214 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2022-11-02 20:58:48,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14) [2022-11-02 20:58:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-11-02 20:58:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:58:48,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:48,216 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:58:48,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:48,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:58:48,431 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:48,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1774035915, now seen corresponding path program 1 times [2022-11-02 20:58:48,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:48,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363235369] [2022-11-02 20:58:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:48,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:48,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:58:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:58:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:58:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:58:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:58:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:58:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:58:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:58:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:58:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:58:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 20:58:49,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:49,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363235369] [2022-11-02 20:58:49,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363235369] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:49,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136197953] [2022-11-02 20:58:49,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:49,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:49,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:49,608 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:49,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:58:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:50,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 2639 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:58:50,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-02 20:58:50,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:58:50,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136197953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:50,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:58:50,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 21 [2022-11-02 20:58:50,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152049467] [2022-11-02 20:58:50,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:50,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:58:50,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:50,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:58:50,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:58:50,343 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-02 20:58:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:50,529 INFO L93 Difference]: Finished difference Result 275 states and 355 transitions. [2022-11-02 20:58:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:58:50,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 100 [2022-11-02 20:58:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:50,531 INFO L225 Difference]: With dead ends: 275 [2022-11-02 20:58:50,531 INFO L226 Difference]: Without dead ends: 214 [2022-11-02 20:58:50,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:58:50,533 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 18 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:50,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 594 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-02 20:58:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 193. [2022-11-02 20:58:50,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 133 states have (on average 1.1353383458646618) internal successors, (151), 137 states have internal predecessors, (151), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (50), 41 states have call predecessors, (50), 43 states have call successors, (50) [2022-11-02 20:58:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 245 transitions. [2022-11-02 20:58:50,556 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 245 transitions. Word has length 100 [2022-11-02 20:58:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:50,556 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 245 transitions. [2022-11-02 20:58:50,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 4 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-02 20:58:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 245 transitions. [2022-11-02 20:58:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-02 20:58:50,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:50,558 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:50,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:50,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:50,772 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:50,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1103291491, now seen corresponding path program 1 times [2022-11-02 20:58:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:50,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084081386] [2022-11-02 20:58:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:50,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:51,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:51,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:58:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:51,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:51,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:58:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:51,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:58:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:58:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:58:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:58:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:58:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:58:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:58:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:58:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:58:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 20:58:52,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:52,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084081386] [2022-11-02 20:58:52,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084081386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:52,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785202484] [2022-11-02 20:58:52,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:52,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:52,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:52,123 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:52,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:58:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:52,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:58:52,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 23 proven. 28 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-02 20:58:52,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:58:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-11-02 20:58:53,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785202484] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:53,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:58:53,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [18, 7] total 27 [2022-11-02 20:58:53,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459046921] [2022-11-02 20:58:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:53,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:58:53,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:53,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:58:53,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:58:53,015 INFO L87 Difference]: Start difference. First operand 193 states and 245 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-02 20:58:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:53,316 INFO L93 Difference]: Finished difference Result 268 states and 338 transitions. [2022-11-02 20:58:53,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:58:53,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 109 [2022-11-02 20:58:53,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:53,318 INFO L225 Difference]: With dead ends: 268 [2022-11-02 20:58:53,318 INFO L226 Difference]: Without dead ends: 214 [2022-11-02 20:58:53,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2022-11-02 20:58:53,320 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 202 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:53,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 591 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:58:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-02 20:58:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 193. [2022-11-02 20:58:53,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 133 states have (on average 1.1203007518796992) internal successors, (149), 137 states have internal predecessors, (149), 44 states have call successors, (44), 14 states have call predecessors, (44), 15 states have return successors, (50), 41 states have call predecessors, (50), 43 states have call successors, (50) [2022-11-02 20:58:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 243 transitions. [2022-11-02 20:58:53,345 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 243 transitions. Word has length 109 [2022-11-02 20:58:53,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:53,346 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 243 transitions. [2022-11-02 20:58:53,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-02 20:58:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 243 transitions. [2022-11-02 20:58:53,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-02 20:58:53,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:53,348 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:53,394 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:53,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:53,563 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:53,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:53,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2087155491, now seen corresponding path program 1 times [2022-11-02 20:58:53,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:53,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131813594] [2022-11-02 20:58:53,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:53,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:58:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:58:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:58:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:58:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:58:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:58:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:58:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:58:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:58:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:58:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:58:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 20:58:54,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:54,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131813594] [2022-11-02 20:58:54,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131813594] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:54,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838294647] [2022-11-02 20:58:54,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:54,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:54,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:54,695 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:54,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:58:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:55,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 2662 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-02 20:58:55,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:58:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-02 20:58:55,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:58:55,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838294647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:55,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:58:55,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 22 [2022-11-02 20:58:55,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957062373] [2022-11-02 20:58:55,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:55,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:58:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:55,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:58:55,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:58:55,387 INFO L87 Difference]: Start difference. First operand 193 states and 243 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-02 20:58:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:55,568 INFO L93 Difference]: Finished difference Result 271 states and 326 transitions. [2022-11-02 20:58:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:58:55,569 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 109 [2022-11-02 20:58:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:55,572 INFO L225 Difference]: With dead ends: 271 [2022-11-02 20:58:55,572 INFO L226 Difference]: Without dead ends: 183 [2022-11-02 20:58:55,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:58:55,573 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 33 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:55,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1246 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:58:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-02 20:58:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-02 20:58:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 127 states have (on average 1.110236220472441) internal successors, (141), 131 states have internal predecessors, (141), 40 states have call successors, (40), 14 states have call predecessors, (40), 15 states have return successors, (43), 37 states have call predecessors, (43), 39 states have call successors, (43) [2022-11-02 20:58:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 224 transitions. [2022-11-02 20:58:55,598 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 224 transitions. Word has length 109 [2022-11-02 20:58:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:55,600 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 224 transitions. [2022-11-02 20:58:55,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-02 20:58:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 224 transitions. [2022-11-02 20:58:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-02 20:58:55,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:55,602 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:58:55,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:58:55,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:58:55,826 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:55,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:55,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1526938213, now seen corresponding path program 1 times [2022-11-02 20:58:55,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:55,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865767687] [2022-11-02 20:58:55,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:55,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:58:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:58:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:58:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:58:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:58:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:58:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:58:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:58:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:58:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:58:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:58:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-11-02 20:58:56,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:56,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865767687] [2022-11-02 20:58:56,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865767687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:56,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:56,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:58:56,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833452658] [2022-11-02 20:58:56,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:56,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:58:56,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:56,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:58:56,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:58:56,344 INFO L87 Difference]: Start difference. First operand 183 states and 224 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:58:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:56,696 INFO L93 Difference]: Finished difference Result 219 states and 264 transitions. [2022-11-02 20:58:56,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:58:56,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2022-11-02 20:58:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:56,698 INFO L225 Difference]: With dead ends: 219 [2022-11-02 20:58:56,698 INFO L226 Difference]: Without dead ends: 164 [2022-11-02 20:58:56,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:58:56,699 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 47 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:56,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 343 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:58:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-02 20:58:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-11-02 20:58:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 114 states have (on average 1.0964912280701755) internal successors, (125), 117 states have internal predecessors, (125), 34 states have call successors, (34), 14 states have call predecessors, (34), 15 states have return successors, (37), 32 states have call predecessors, (37), 33 states have call successors, (37) [2022-11-02 20:58:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2022-11-02 20:58:56,718 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 109 [2022-11-02 20:58:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:56,719 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2022-11-02 20:58:56,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:58:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2022-11-02 20:58:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-02 20:58:56,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:56,721 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:58:56,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:58:56,721 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:56,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:56,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2132558451, now seen corresponding path program 1 times [2022-11-02 20:58:56,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:56,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435204338] [2022-11-02 20:58:56,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:58:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:58:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:58:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:58:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:58:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:58:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:58:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:58:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:58:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:58:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:58:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:58:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:58:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:58:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-11-02 20:58:57,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:57,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435204338] [2022-11-02 20:58:57,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435204338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:57,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:57,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:58:57,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504110235] [2022-11-02 20:58:57,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:57,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:58:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:57,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:58:57,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:58:57,353 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:58:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:57,795 INFO L93 Difference]: Finished difference Result 203 states and 239 transitions. [2022-11-02 20:58:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:58:57,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 134 [2022-11-02 20:58:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:57,797 INFO L225 Difference]: With dead ends: 203 [2022-11-02 20:58:57,797 INFO L226 Difference]: Without dead ends: 164 [2022-11-02 20:58:57,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:58:57,798 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 48 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:57,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 460 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:58:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-02 20:58:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-11-02 20:58:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 114 states have (on average 1.087719298245614) internal successors, (124), 117 states have internal predecessors, (124), 34 states have call successors, (34), 14 states have call predecessors, (34), 15 states have return successors, (37), 32 states have call predecessors, (37), 33 states have call successors, (37) [2022-11-02 20:58:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 195 transitions. [2022-11-02 20:58:57,818 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 195 transitions. Word has length 134 [2022-11-02 20:58:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:57,818 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 195 transitions. [2022-11-02 20:58:57,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:58:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 195 transitions. [2022-11-02 20:58:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-02 20:58:57,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:57,821 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:58:57,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:58:57,821 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:57,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash 284756267, now seen corresponding path program 1 times [2022-11-02 20:58:57,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:57,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564865803] [2022-11-02 20:58:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:57,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:58:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:58:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:58:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:58:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:58:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:58:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-02 20:58:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-02 20:58:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:58:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:58:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:58:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-02 20:58:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-02 20:58:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:58:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 20:58:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-02 20:58:59,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:59,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564865803] [2022-11-02 20:58:59,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564865803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:58:59,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261098794] [2022-11-02 20:58:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:59,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:58:59,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:58:59,846 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:58:59,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:59:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:59:00,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 2752 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-02 20:59:00,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:59:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 9 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-02 20:59:04,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:59:13,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261098794] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:59:13,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:59:13,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 34] total 44 [2022-11-02 20:59:13,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472013394] [2022-11-02 20:59:13,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:59:13,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 20:59:13,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:59:13,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 20:59:13,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2022-11-02 20:59:13,281 INFO L87 Difference]: Start difference. First operand 164 states and 195 transitions. Second operand has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2022-11-02 20:59:14,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:59:14,727 INFO L93 Difference]: Finished difference Result 179 states and 207 transitions. [2022-11-02 20:59:14,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:59:14,735 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) Word has length 135 [2022-11-02 20:59:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:59:14,736 INFO L225 Difference]: With dead ends: 179 [2022-11-02 20:59:14,736 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:59:14,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=287, Invalid=4405, Unknown=0, NotChecked=0, Total=4692 [2022-11-02 20:59:14,739 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:59:14,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 395 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 597 Invalid, 0 Unknown, 54 Unchecked, 0.7s Time] [2022-11-02 20:59:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:59:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:59:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:59:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:59:14,742 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2022-11-02 20:59:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:59:14,742 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:59:14,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 38 states have (on average 3.236842105263158) internal successors, (123), 33 states have internal predecessors, (123), 15 states have call successors, (39), 7 states have call predecessors, (39), 11 states have return successors, (37), 15 states have call predecessors, (37), 14 states have call successors, (37) [2022-11-02 20:59:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:59:14,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:59:14,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:59:14,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:59:14,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-02 20:59:14,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:59:17,993 INFO L895 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0))) [2022-11-02 20:59:17,993 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2022-11-02 20:59:17,993 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2022-11-02 20:59:17,993 INFO L899 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2022-11-02 20:59:17,993 INFO L895 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (or (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (or .cse0 (<= 0 (+ (* 18446744073709551616 (div (+ (- |ensure_string_is_allocated_bounded_length_~len~1#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_~len~1#1|))) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (<= 0 (+ (* 18446744073709551616 (div (+ (- |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|))) (= |old(#valid)| |#valid|))) (not (< 0 |#StackHeapBarrier|))) [2022-11-02 20:59:17,993 INFO L899 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2022-11-02 20:59:17,993 INFO L895 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) [2022-11-02 20:59:17,993 INFO L899 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2022-11-02 20:59:17,994 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-11-02 20:59:17,994 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) (not (< 0 |#StackHeapBarrier|))) [2022-11-02 20:59:17,994 INFO L899 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2022-11-02 20:59:17,994 INFO L899 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2022-11-02 20:59:17,994 INFO L895 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-11-02 20:59:17,995 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-11-02 20:59:17,995 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2022-11-02 20:59:17,995 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-02 20:59:17,995 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-11-02 20:59:17,995 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-11-02 20:59:17,995 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-11-02 20:59:17,995 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (let ((.cse0 (not (< 0 |#StackHeapBarrier|)))) (and (or (= |bounded_malloc_#in~size| bounded_malloc_~size) .cse0) (or .cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))))) [2022-11-02 20:59:17,996 INFO L902 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2022-11-02 20:59:17,996 INFO L899 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2022-11-02 20:59:17,996 INFO L899 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2022-11-02 20:59:17,996 INFO L902 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2022-11-02 20:59:17,996 INFO L899 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2022-11-02 20:59:17,997 INFO L899 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2022-11-02 20:59:17,997 INFO L902 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2022-11-02 20:59:17,999 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-11-02 20:59:17,999 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-11-02 20:59:17,999 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-11-02 20:59:17,999 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-02 20:59:18,000 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-02 20:59:18,001 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-02 20:59:18,001 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-02 20:59:18,001 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2022-11-02 20:59:18,002 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2022-11-02 20:59:18,008 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2022-11-02 20:59:18,009 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2022-11-02 20:59:18,009 INFO L899 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2022-11-02 20:59:18,009 INFO L899 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2022-11-02 20:59:18,009 INFO L899 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2022-11-02 20:59:18,009 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2022-11-02 20:59:18,009 INFO L899 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2022-11-02 20:59:18,009 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2022-11-02 20:59:18,010 INFO L902 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7368 7372) the Hoare annotation is: true [2022-11-02 20:59:18,010 INFO L899 garLoopResultBuilder]: For program point L7371(line 7371) no Hoare annotation was computed. [2022-11-02 20:59:18,010 INFO L899 garLoopResultBuilder]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2022-11-02 20:59:18,010 INFO L899 garLoopResultBuilder]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2022-11-02 20:59:18,010 INFO L899 garLoopResultBuilder]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2022-11-02 20:59:18,010 INFO L899 garLoopResultBuilder]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2022-11-02 20:59:18,010 INFO L899 garLoopResultBuilder]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2022-11-02 20:59:18,011 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7368 7372) no Hoare annotation was computed. [2022-11-02 20:59:18,011 INFO L899 garLoopResultBuilder]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2022-11-02 20:59:18,011 INFO L899 garLoopResultBuilder]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2022-11-02 20:59:18,011 INFO L899 garLoopResultBuilder]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2022-11-02 20:59:18,011 INFO L899 garLoopResultBuilder]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2022-11-02 20:59:18,011 INFO L899 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7368 7372) no Hoare annotation was computed. [2022-11-02 20:59:18,011 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-02 20:59:18,012 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-02 20:59:18,012 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-02 20:59:18,012 INFO L899 garLoopResultBuilder]: For program point L6675-1(line 6675) no Hoare annotation was computed. [2022-11-02 20:59:18,013 INFO L895 garLoopResultBuilder]: At program point L6675(line 6675) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (< 0 |#StackHeapBarrier|)) [2022-11-02 20:59:18,013 INFO L899 garLoopResultBuilder]: For program point L9549(lines 9549 9550) no Hoare annotation was computed. [2022-11-02 20:59:18,013 INFO L899 garLoopResultBuilder]: For program point L9549-2(lines 9549 9550) no Hoare annotation was computed. [2022-11-02 20:59:18,013 INFO L899 garLoopResultBuilder]: For program point L9549-3(lines 9549 9559) no Hoare annotation was computed. [2022-11-02 20:59:18,014 INFO L895 garLoopResultBuilder]: At program point L9549-4(lines 9549 9559) the Hoare annotation is: (let ((.cse1 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse2 (< 0 |#StackHeapBarrier|))) (or (and (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) .cse1 .cse2))) [2022-11-02 20:59:18,014 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:59:18,014 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:59:18,014 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2022-11-02 20:59:18,014 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-11-02 20:59:18,014 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-11-02 20:59:18,015 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2022-11-02 20:59:18,016 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-11-02 20:59:18,018 INFO L895 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: (and (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1359#1| 1) (<= 1 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1359#1|) (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (< 0 |#StackHeapBarrier|)) [2022-11-02 20:59:18,018 INFO L899 garLoopResultBuilder]: For program point L9560-1(line 9560) no Hoare annotation was computed. [2022-11-02 20:59:18,018 INFO L895 garLoopResultBuilder]: At program point L9329-4(line 9329) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (let ((.cse10 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (.cse11 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse1 (<= 0 (+ (* 18446744073709551616 (div (- .cse18) 18446744073709551616)) .cse18))) (.cse16 (not .cse6)) (.cse17 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse12 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0)) (.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse14 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse15 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse3 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse5 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse7 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse8 (< 0 |#StackHeapBarrier|)) (.cse9 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|))) (or (and .cse0 .cse1 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1| .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1| .cse13 .cse2 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse8) (and .cse10 .cse11 .cse0 .cse16 .cse17 .cse12 .cse13 .cse2 .cse15 .cse3 .cse5 .cse8) (and .cse10 .cse11 (<= .cse18 (* (div .cse18 18446744073709551616) 18446744073709551616)) .cse12 .cse13 .cse4 .cse5 .cse6 .cse8) (and .cse10 .cse11 .cse0 .cse1 .cse16 .cse17 .cse12 .cse13 .cse2 .cse3 .cse5 .cse8) (and |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1| .cse2 .cse14 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2022-11-02 20:59:18,018 INFO L899 garLoopResultBuilder]: For program point L9329-5(line 9329) no Hoare annotation was computed. [2022-11-02 20:59:18,018 INFO L899 garLoopResultBuilder]: For program point L9329(line 9329) no Hoare annotation was computed. [2022-11-02 20:59:18,019 INFO L895 garLoopResultBuilder]: At program point L9552(line 9552) the Hoare annotation is: false [2022-11-02 20:59:18,019 INFO L895 garLoopResultBuilder]: At program point L9329-2(line 9329) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse8 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse9 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse10 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse11 (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1290#1|)) (.cse12 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 (<= 0 (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse2) 18446744073709551616)) .cse2))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse9 .cse10 .cse11 .cse12))) [2022-11-02 20:59:18,019 INFO L895 garLoopResultBuilder]: At program point L9552-1(line 9552) the Hoare annotation is: false [2022-11-02 20:59:18,019 INFO L899 garLoopResultBuilder]: For program point L9329-3(line 9329) no Hoare annotation was computed. [2022-11-02 20:59:18,019 INFO L899 garLoopResultBuilder]: For program point L9552-2(line 9552) no Hoare annotation was computed. [2022-11-02 20:59:18,019 INFO L895 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse3 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse5 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 8)) 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse1 .cse2 .cse3 .cse4 .cse5))) [2022-11-02 20:59:18,020 INFO L895 garLoopResultBuilder]: At program point L9544-1(line 9544) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse4 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse0 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse1 (< 0 |#StackHeapBarrier|))) (or (and (<= 0 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1349#1|) (<= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ret1349#1| 0) .cse0 .cse1) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 0 (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse2) 18446744073709551616)) .cse2))) .cse3 .cse4 .cse5 .cse0 .cse6 .cse1) (and .cse3 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse4 .cse5 .cse0 .cse6 .cse1))) [2022-11-02 20:59:18,020 INFO L899 garLoopResultBuilder]: For program point L9544-2(line 9544) no Hoare annotation was computed. [2022-11-02 20:59:18,020 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-11-02 20:59:18,020 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2022-11-02 20:59:18,020 INFO L899 garLoopResultBuilder]: For program point L9330(line 9330) no Hoare annotation was computed. [2022-11-02 20:59:18,020 INFO L899 garLoopResultBuilder]: For program point L9330-5(line 9330) no Hoare annotation was computed. [2022-11-02 20:59:18,021 INFO L899 garLoopResultBuilder]: For program point L9553(lines 9553 9558) no Hoare annotation was computed. [2022-11-02 20:59:18,021 INFO L895 garLoopResultBuilder]: At program point L9330-2(line 9330) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse3 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse5 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse6 (< 0 |#StackHeapBarrier|)) (.cse7 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|))) (or (and .cse0 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 0 (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse8) 18446744073709551616)) .cse8))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-02 20:59:18,021 INFO L899 garLoopResultBuilder]: For program point L9330-3(line 9330) no Hoare annotation was computed. [2022-11-02 20:59:18,021 INFO L895 garLoopResultBuilder]: At program point L9330-4(line 9330) the Hoare annotation is: (let ((.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse10 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0))) (let ((.cse12 (not .cse10)) (.cse13 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0))) (.cse5 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0)) (.cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse14 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse15 (<= 0 (+ (* 18446744073709551616 (div (- .cse18) 18446744073709551616)) .cse18))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse7 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse16 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse17 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base| 0)) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.offset| 0)) (.cse8 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse9 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse11 (< 0 |#StackHeapBarrier|))) (or (and .cse0 .cse1 .cse2 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse2 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11) (and .cse0 .cse1 .cse14 .cse15 .cse12 .cse13 .cse2 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse3 .cse4 .cse7 .cse9 .cse11) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse17) (and .cse14 .cse15 .cse4 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse17) (and .cse0 .cse1 (<= .cse18 (* (div .cse18 18446744073709551616) 18446744073709551616)) .cse2 |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1292#1| .cse3 .cse8 .cse9 .cse10 .cse11)))) [2022-11-02 20:59:18,021 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:59:18,022 INFO L902 garLoopResultBuilder]: At program point L9562(line 9562) the Hoare annotation is: true [2022-11-02 20:59:18,022 INFO L899 garLoopResultBuilder]: For program point L9537(lines 9537 9561) no Hoare annotation was computed. [2022-11-02 20:59:18,022 INFO L899 garLoopResultBuilder]: For program point L9331(lines 9331 9339) no Hoare annotation was computed. [2022-11-02 20:59:18,022 INFO L895 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2022-11-02 20:59:18,022 INFO L899 garLoopResultBuilder]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2022-11-02 20:59:18,022 INFO L899 garLoopResultBuilder]: For program point L9554-1(line 9554) no Hoare annotation was computed. [2022-11-02 20:59:18,022 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2022-11-02 20:59:18,023 INFO L895 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2022-11-02 20:59:18,023 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-11-02 20:59:18,023 INFO L899 garLoopResultBuilder]: For program point L9538-5(lines 9538 9539) no Hoare annotation was computed. [2022-11-02 20:59:18,023 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:59:18,023 INFO L899 garLoopResultBuilder]: For program point L9340(lines 9340 9348) no Hoare annotation was computed. [2022-11-02 20:59:18,023 INFO L899 garLoopResultBuilder]: For program point L9538-1(lines 9538 9539) no Hoare annotation was computed. [2022-11-02 20:59:18,023 INFO L895 garLoopResultBuilder]: At program point L9538-2(line 9538) the Hoare annotation is: (< 0 |#StackHeapBarrier|) [2022-11-02 20:59:18,024 INFO L899 garLoopResultBuilder]: For program point L9538-3(line 9538) no Hoare annotation was computed. [2022-11-02 20:59:18,024 INFO L899 garLoopResultBuilder]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2022-11-02 20:59:18,024 INFO L899 garLoopResultBuilder]: For program point L6673-3(lines 6673 6675) no Hoare annotation was computed. [2022-11-02 20:59:18,024 INFO L899 garLoopResultBuilder]: For program point L6673-1(lines 6673 6675) no Hoare annotation was computed. [2022-11-02 20:59:18,025 INFO L895 garLoopResultBuilder]: At program point L6673(line 6673) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0) (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0) (< 0 |#StackHeapBarrier|)) [2022-11-02 20:59:18,025 INFO L895 garLoopResultBuilder]: At program point L9349(line 9349) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse4 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse6 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1351#1.base|)) (.cse7 (< 0 |#StackHeapBarrier|)) (.cse8 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_~cur#1.base|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (<= .cse0 (* (div .cse0 18446744073709551616) 18446744073709551616))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-02 20:59:18,025 INFO L899 garLoopResultBuilder]: For program point L9349-1(line 9349) no Hoare annotation was computed. [2022-11-02 20:59:18,025 INFO L895 garLoopResultBuilder]: At program point L9349-2(lines 9327 9350) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0)) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0))) (.cse4 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse7 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse8 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse5 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse0 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse6 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_#res#1| 0) (not .cse0) (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_~str#1.base| 0)) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (<= 0 (+ (* 18446744073709551616 (div (- .cse7) 18446744073709551616)) .cse7)) .cse2 .cse4 .cse5 .cse6))) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse0 .cse6) (and (<= .cse7 (* (div .cse7 18446744073709551616) 18446744073709551616)) .cse8 .cse5 .cse0 .cse6))) [2022-11-02 20:59:18,025 INFO L895 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base| |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.base|)) (.cse2 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.offset| 0)) (.cse4 (<= 2 |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3#1.base| 0)) (.cse6 (< 0 |#StackHeapBarrier|))) (or (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset| 0) (<= 0 (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.offset|))) (+ (* 18446744073709551616 (div (- .cse0) 18446744073709551616)) .cse0))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (= |ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2#1.base|) 8) 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-11-02 20:59:18,026 INFO L899 garLoopResultBuilder]: For program point L9548-1(line 9548) no Hoare annotation was computed. [2022-11-02 20:59:18,026 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-02 20:59:18,026 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-02 20:59:18,026 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-02 20:59:18,026 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-02 20:59:18,026 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-02 20:59:18,027 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-02 20:59:18,030 INFO L444 BasicCegarLoop]: Path program histogram: [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-02 20:59:18,036 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:59:18,051 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:59:18,057 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:59:18,069 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:59:18,071 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:59:18,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:59:18 BoogieIcfgContainer [2022-11-02 20:59:18,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:59:18,090 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:59:18,090 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:59:18,090 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:59:18,090 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:58:09" (3/4) ... [2022-11-02 20:59:18,093 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:59:18,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-11-02 20:59:18,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-02 20:59:18,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2022-11-02 20:59:18,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2022-11-02 20:59:18,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-02 20:59:18,099 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-11-02 20:59:18,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-02 20:59:18,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-02 20:59:18,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-11-02 20:59:18,100 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-11-02 20:59:18,121 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 127 nodes and edges [2022-11-02 20:59:18,123 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-11-02 20:59:18,124 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-02 20:59:18,125 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-02 20:59:18,127 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-02 20:59:18,128 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-02 20:59:18,129 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:59:18,130 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:59:18,157 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 0 && !(str == 0)) && !(str == 0)) && ((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 2 <= cursor) && 0 < unknown-#StackHeapBarrier-unknown) || (((((cursor == 0 && 0 <= 18446744073709551616 * (-unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) + unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && cursor == cursor) && 2 <= cursor) && 0 < unknown-#StackHeapBarrier-unknown))) || (((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && str == 0) && 2 <= cursor) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown)) || ((((unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 && str == 0) && 2 <= cursor) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) [2022-11-02 20:59:18,157 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0 < unknown-#StackHeapBarrier-unknown) || ((((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && str == 0) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) [2022-11-02 20:59:18,650 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:59:18,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:59:18,651 INFO L158 Benchmark]: Toolchain (without parser) took 74265.37ms. Allocated memory was 127.9MB in the beginning and 950.0MB in the end (delta: 822.1MB). Free memory was 83.7MB in the beginning and 792.7MB in the end (delta: -709.1MB). Peak memory consumption was 614.2MB. Max. memory is 16.1GB. [2022-11-02 20:59:18,651 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 86.0MB. Free memory was 56.5MB in the beginning and 56.4MB in the end (delta: 28.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:59:18,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3075.73ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 83.4MB in the beginning and 129.7MB in the end (delta: -46.3MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2022-11-02 20:59:18,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 220.52ms. Allocated memory is still 184.5MB. Free memory was 129.7MB in the beginning and 118.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:59:18,653 INFO L158 Benchmark]: Boogie Preprocessor took 122.74ms. Allocated memory is still 184.5MB. Free memory was 118.2MB in the beginning and 110.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:59:18,653 INFO L158 Benchmark]: RCFGBuilder took 1979.51ms. Allocated memory is still 184.5MB. Free memory was 110.9MB in the beginning and 81.9MB in the end (delta: 28.9MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2022-11-02 20:59:18,653 INFO L158 Benchmark]: TraceAbstraction took 68299.04ms. Allocated memory was 184.5MB in the beginning and 950.0MB in the end (delta: 765.5MB). Free memory was 81.9MB in the beginning and 359.1MB in the end (delta: -277.1MB). Peak memory consumption was 488.3MB. Max. memory is 16.1GB. [2022-11-02 20:59:18,654 INFO L158 Benchmark]: Witness Printer took 560.61ms. Allocated memory is still 950.0MB. Free memory was 359.1MB in the beginning and 792.7MB in the end (delta: -433.7MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2022-11-02 20:59:18,655 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 86.0MB. Free memory was 56.5MB in the beginning and 56.4MB in the end (delta: 28.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3075.73ms. Allocated memory was 127.9MB in the beginning and 184.5MB in the end (delta: 56.6MB). Free memory was 83.4MB in the beginning and 129.7MB in the end (delta: -46.3MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 220.52ms. Allocated memory is still 184.5MB. Free memory was 129.7MB in the beginning and 118.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.74ms. Allocated memory is still 184.5MB. Free memory was 118.2MB in the beginning and 110.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1979.51ms. Allocated memory is still 184.5MB. Free memory was 110.9MB in the beginning and 81.9MB in the end (delta: 28.9MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. * TraceAbstraction took 68299.04ms. Allocated memory was 184.5MB in the beginning and 950.0MB in the end (delta: 765.5MB). Free memory was 81.9MB in the beginning and 359.1MB in the end (delta: -277.1MB). Peak memory consumption was 488.3MB. Max. memory is 16.1GB. * Witness Printer took 560.61ms. Allocated memory is still 950.0MB. Free memory was 359.1MB in the beginning and 792.7MB in the end (delta: -433.7MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.1s, OverallIterations: 24, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2309 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2172 mSDsluCounter, 18661 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 432 IncrementalHoareTripleChecker+Unchecked, 15106 mSDsCounter, 661 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5156 IncrementalHoareTripleChecker+Invalid, 6249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 661 mSolverCounterUnsat, 3555 mSDtfsCounter, 5156 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2524 GetRequests, 2102 SyntacticMatches, 36 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 16.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=7, InterpolantAutomatonStates: 218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 320 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 483 PreInvPairs, 541 NumberOfFragments, 1537 HoareAnnotationTreeSize, 483 FomulaSimplifications, 991 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 42 FomulaSimplificationsInter, 11639 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 6.7s SatisfiabilityAnalysisTime, 40.8s InterpolantComputationTime, 3303 NumberOfCodeBlocks, 3303 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3714 ConstructedInterpolants, 106 QuantifiedInterpolants, 15836 SizeOfPredicates, 117 NumberOfNonLiveVariables, 38463 ConjunctsInSsa, 315 ConjunctsInUnsatCore, 45 InterpolantComputations, 19 PerfectInterpolantSequences, 1734/2007 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 9327]: Loop Invariant [2022-11-02 20:59:18,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:59:18,663 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:59:18,664 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-02 20:59:18,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((\result == 0 && !(str == 0)) && !(str == 0)) && ((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && 2 <= cursor) && 0 < unknown-#StackHeapBarrier-unknown) || (((((cursor == 0 && 0 <= 18446744073709551616 * (-unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) + unknown-#memory_int-unknown[cursor][cursor]) && cursor == cursor) && cursor == cursor) && 2 <= cursor) && 0 < unknown-#StackHeapBarrier-unknown))) || (((((((cursor == 0 && cursor == cursor) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && str == 0) && 2 <= cursor) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown)) || ((((unknown-#memory_int-unknown[cursor][cursor] <= unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616 * 18446744073709551616 && str == 0) && 2 <= cursor) && str == 0) && 0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: !(0 < unknown-#StackHeapBarrier-unknown) || ((((((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && str == 0) && !(\result == 0)) && !(\old(max_size) == 16)) && \result == 0) RESULT: Ultimate proved your program to be correct! [2022-11-02 20:59:18,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47b85e74-fe56-44d2-9752-931a28d7d16a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE