./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 03:58:22,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:58:22,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:58:22,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:58:22,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:58:22,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:58:22,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:58:22,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:58:22,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:58:22,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:58:22,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:58:22,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:58:22,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:58:22,447 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:58:22,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:58:22,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:58:22,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:58:22,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:58:22,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:58:22,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:58:22,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:58:22,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:58:22,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:58:22,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:58:22,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:58:22,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:58:22,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:58:22,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:58:22,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:58:22,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:58:22,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:58:22,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:58:22,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:58:22,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:58:22,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:58:22,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:58:22,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:58:22,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:58:22,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:58:22,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:58:22,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:58:22,475 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-23 03:58:22,496 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:58:22,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:58:22,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:58:22,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:58:22,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:58:22,497 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:58:22,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:58:22,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:58:22,499 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:58:22,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:58:22,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:58:22,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:58:22,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:58:22,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:58:22,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:58:22,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:58:22,501 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:58:22,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:58:22,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:58:22,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:58:22,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:58:22,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:58:22,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:58:22,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:58:22,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:58:22,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:58:22,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:58:22,503 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:58:22,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:58:22,504 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:58:22,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:58:22,504 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c [2022-11-23 03:58:22,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:58:22,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:58:22,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:58:22,851 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:58:22,851 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:58:22,853 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2022-11-23 03:58:25,880 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:58:26,411 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:58:26,413 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2022-11-23 03:58:26,452 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/data/4a974832c/b10a7068fc714dc7859858645c2765d3/FLAGf23fef1ec [2022-11-23 03:58:26,475 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/data/4a974832c/b10a7068fc714dc7859858645c2765d3 [2022-11-23 03:58:26,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:58:26,482 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:58:26,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:58:26,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:58:26,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:58:26,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:58:26" (1/1) ... [2022-11-23 03:58:26,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc89cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:26, skipping insertion in model container [2022-11-23 03:58:26,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:58:26" (1/1) ... [2022-11-23 03:58:26,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:58:26,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:58:26,898 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2022-11-23 03:58:26,905 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2022-11-23 03:58:27,800 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:27,801 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:27,803 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:27,804 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:27,805 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:27,834 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:27,835 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:27,841 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:27,841 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:28,273 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-23 03:58:28,274 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-23 03:58:28,275 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-23 03:58:28,277 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-23 03:58:28,278 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-23 03:58:28,279 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-23 03:58:28,280 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-23 03:58:28,281 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-23 03:58:28,281 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-23 03:58:28,282 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-23 03:58:28,456 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-23 03:58:28,594 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:28,595 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:28,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:58:28,723 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:58:28,738 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2022-11-23 03:58:28,738 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2022-11-23 03:58:28,777 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:28,778 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:28,779 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:28,779 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:28,780 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:28,787 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:28,788 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:28,789 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:28,789 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:28,829 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-23 03:58:28,831 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-23 03:58:28,833 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-23 03:58:28,834 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-23 03:58:28,835 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-23 03:58:28,836 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-23 03:58:28,837 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-23 03:58:28,838 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-23 03:58:28,839 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-23 03:58:28,840 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-23 03:58:28,888 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-23 03:58:29,002 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:29,002 WARN L1569 CHandler]: Possible shadowing of function index [2022-11-23 03:58:29,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:58:29,306 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:58:29,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29 WrapperNode [2022-11-23 03:58:29,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:58:29,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:58:29,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:58:29,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:58:29,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29" (1/1) ... [2022-11-23 03:58:29,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29" (1/1) ... [2022-11-23 03:58:29,521 INFO L138 Inliner]: procedures = 690, calls = 2614, calls flagged for inlining = 57, calls inlined = 4, statements flattened = 765 [2022-11-23 03:58:29,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:58:29,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:58:29,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:58:29,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:58:29,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29" (1/1) ... [2022-11-23 03:58:29,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29" (1/1) ... [2022-11-23 03:58:29,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29" (1/1) ... [2022-11-23 03:58:29,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29" (1/1) ... [2022-11-23 03:58:29,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29" (1/1) ... [2022-11-23 03:58:29,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29" (1/1) ... [2022-11-23 03:58:29,636 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29" (1/1) ... [2022-11-23 03:58:29,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29" (1/1) ... [2022-11-23 03:58:29,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:58:29,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:58:29,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:58:29,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:58:29,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29" (1/1) ... [2022-11-23 03:58:29,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:58:29,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:58:29,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:58:29,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:58:29,732 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2022-11-23 03:58:29,732 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2022-11-23 03:58:29,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:58:29,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 03:58:29,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 03:58:29,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 03:58:29,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 03:58:29,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:58:29,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 03:58:29,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:58:29,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:58:29,734 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-23 03:58:29,734 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-23 03:58:29,734 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-23 03:58:29,734 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-23 03:58:29,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:58:29,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 03:58:29,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-23 03:58:29,735 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-23 03:58:29,735 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-23 03:58:29,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:58:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:58:29,736 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_from_array [2022-11-23 03:58:29,736 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_from_array [2022-11-23 03:58:29,985 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:58:29,987 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:58:31,354 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:58:31,366 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:58:31,366 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 03:58:31,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:31 BoogieIcfgContainer [2022-11-23 03:58:31,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:58:31,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:58:31,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:58:31,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:58:31,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:58:26" (1/3) ... [2022-11-23 03:58:31,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf996a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:58:31, skipping insertion in model container [2022-11-23 03:58:31,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:58:29" (2/3) ... [2022-11-23 03:58:31,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf996a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:58:31, skipping insertion in model container [2022-11-23 03:58:31,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:31" (3/3) ... [2022-11-23 03:58:31,380 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_array_harness.i [2022-11-23 03:58:31,399 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:58:31,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 03:58:31,462 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:58:31,474 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;@48b48450, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:58:31,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 03:58:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-23 03:58:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 03:58:31,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:31,493 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:58:31,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:31,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2742655, now seen corresponding path program 1 times [2022-11-23 03:58:31,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:31,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543928358] [2022-11-23 03:58:31,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:31,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:32,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:32,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:32,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:58:32,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:32,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543928358] [2022-11-23 03:58:32,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543928358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:32,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:32,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:58:32,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782229455] [2022-11-23 03:58:32,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:32,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:58:32,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:32,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:58:32,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:58:32,278 INFO L87 Difference]: Start difference. First operand has 73 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 03:58:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:32,562 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2022-11-23 03:58:32,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:58:32,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-11-23 03:58:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:32,573 INFO L225 Difference]: With dead ends: 141 [2022-11-23 03:58:32,574 INFO L226 Difference]: Without dead ends: 66 [2022-11-23 03:58:32,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:58:32,580 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:32,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 74 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 03:58:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-23 03:58:32,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-23 03:58:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 45 states have internal predecessors, (52), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-23 03:58:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2022-11-23 03:58:32,624 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 31 [2022-11-23 03:58:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:32,625 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2022-11-23 03:58:32,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 03:58:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-11-23 03:58:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 03:58:32,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:32,627 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:58:32,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:58:32,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:32,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash -873311295, now seen corresponding path program 1 times [2022-11-23 03:58:32,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:32,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143746471] [2022-11-23 03:58:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:32,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:33,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:33,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:33,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:33,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:58:33,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:33,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143746471] [2022-11-23 03:58:33,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143746471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:33,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:33,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:58:33,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244131581] [2022-11-23 03:58:33,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:33,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:58:33,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:33,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:58:33,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:58:33,479 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 03:58:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:33,817 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2022-11-23 03:58:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:58:33,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-11-23 03:58:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:33,821 INFO L225 Difference]: With dead ends: 121 [2022-11-23 03:58:33,821 INFO L226 Difference]: Without dead ends: 69 [2022-11-23 03:58:33,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-23 03:58:33,823 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 58 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:33,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 119 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:58:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-23 03:58:33,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-23 03:58:33,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.173913043478261) internal successors, (54), 48 states have internal predecessors, (54), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-11-23 03:58:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2022-11-23 03:58:33,834 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 31 [2022-11-23 03:58:33,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:33,835 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2022-11-23 03:58:33,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 03:58:33,835 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-11-23 03:58:33,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 03:58:33,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:33,836 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:58:33,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:58:33,837 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash 355281356, now seen corresponding path program 1 times [2022-11-23 03:58:33,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:33,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785717947] [2022-11-23 03:58:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:33,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:34,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:34,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:34,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:34,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:58:34,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:34,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785717947] [2022-11-23 03:58:34,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785717947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:34,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:34,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 03:58:34,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829950355] [2022-11-23 03:58:34,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:34,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 03:58:34,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:34,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 03:58:34,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:58:34,961 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 03:58:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:35,471 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2022-11-23 03:58:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:58:35,472 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-11-23 03:58:35,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:35,473 INFO L225 Difference]: With dead ends: 81 [2022-11-23 03:58:35,473 INFO L226 Difference]: Without dead ends: 79 [2022-11-23 03:58:35,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-11-23 03:58:35,474 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 62 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:35,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 250 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 03:58:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-23 03:58:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-11-23 03:58:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 55 states have internal predecessors, (60), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-11-23 03:58:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 94 transitions. [2022-11-23 03:58:35,497 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 94 transitions. Word has length 37 [2022-11-23 03:58:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:35,498 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 94 transitions. [2022-11-23 03:58:35,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 03:58:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 94 transitions. [2022-11-23 03:58:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 03:58:35,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:35,499 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:58:35,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:58:35,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:35,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1397933292, now seen corresponding path program 1 times [2022-11-23 03:58:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:35,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409327693] [2022-11-23 03:58:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:36,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:36,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:36,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:36,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:58:36,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:36,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409327693] [2022-11-23 03:58:36,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409327693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:36,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:36,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:58:36,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970850201] [2022-11-23 03:58:36,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:36,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:58:36,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:36,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:58:36,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:58:36,462 INFO L87 Difference]: Start difference. First operand 78 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 03:58:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:36,855 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2022-11-23 03:58:36,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 03:58:36,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-11-23 03:58:36,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:36,858 INFO L225 Difference]: With dead ends: 162 [2022-11-23 03:58:36,858 INFO L226 Difference]: Without dead ends: 103 [2022-11-23 03:58:36,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:58:36,860 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 115 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:36,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 120 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:58:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-23 03:58:36,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2022-11-23 03:58:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 60 states have internal predecessors, (67), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-11-23 03:58:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2022-11-23 03:58:36,870 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 41 [2022-11-23 03:58:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:36,870 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2022-11-23 03:58:36,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 03:58:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2022-11-23 03:58:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 03:58:36,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:36,876 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:58:36,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:58:36,876 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:36,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:36,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1139767854, now seen corresponding path program 1 times [2022-11-23 03:58:36,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:36,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674771189] [2022-11-23 03:58:36,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:36,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:40,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:40,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:40,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:58:40,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:40,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674771189] [2022-11-23 03:58:40,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674771189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:40,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:40,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 03:58:40,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393440640] [2022-11-23 03:58:40,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:40,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 03:58:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:40,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 03:58:41,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:58:41,000 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 03:58:42,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:42,058 INFO L93 Difference]: Finished difference Result 166 states and 205 transitions. [2022-11-23 03:58:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 03:58:42,059 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-23 03:58:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:42,060 INFO L225 Difference]: With dead ends: 166 [2022-11-23 03:58:42,061 INFO L226 Difference]: Without dead ends: 102 [2022-11-23 03:58:42,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-11-23 03:58:42,062 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 148 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:42,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 223 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 03:58:42,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-23 03:58:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2022-11-23 03:58:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 72 states have internal predecessors, (84), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-11-23 03:58:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2022-11-23 03:58:42,074 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 41 [2022-11-23 03:58:42,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:42,074 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2022-11-23 03:58:42,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 03:58:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2022-11-23 03:58:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 03:58:42,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:42,076 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:58:42,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:58:42,076 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:42,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:42,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1875335764, now seen corresponding path program 1 times [2022-11-23 03:58:42,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:42,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92012048] [2022-11-23 03:58:42,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:42,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:44,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:44,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:45,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:58:45,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:45,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92012048] [2022-11-23 03:58:45,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92012048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:45,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:45,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 03:58:45,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331594498] [2022-11-23 03:58:45,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:45,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 03:58:45,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:45,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 03:58:45,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:58:45,123 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 03:58:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:46,338 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2022-11-23 03:58:46,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 03:58:46,339 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-23 03:58:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:46,340 INFO L225 Difference]: With dead ends: 199 [2022-11-23 03:58:46,340 INFO L226 Difference]: Without dead ends: 118 [2022-11-23 03:58:46,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-11-23 03:58:46,342 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 168 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:46,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 207 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 03:58:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-23 03:58:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 94. [2022-11-23 03:58:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 71 states have internal predecessors, (83), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-11-23 03:58:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2022-11-23 03:58:46,360 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 41 [2022-11-23 03:58:46,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:46,361 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2022-11-23 03:58:46,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 03:58:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-11-23 03:58:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 03:58:46,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:46,367 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:58:46,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 03:58:46,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:46,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash 28822424, now seen corresponding path program 1 times [2022-11-23 03:58:46,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:46,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90643572] [2022-11-23 03:58:46,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:46,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:49,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:49,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:49,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:49,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:58:49,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:49,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90643572] [2022-11-23 03:58:49,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90643572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:58:49,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652452811] [2022-11-23 03:58:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:49,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:49,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:58:49,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:58:49,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 03:58:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:50,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 2418 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-23 03:58:50,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:58:50,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:58:50,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:58:50,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 03:58:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:58:51,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:58:51,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652452811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:51,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:58:51,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 22 [2022-11-23 03:58:51,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093086808] [2022-11-23 03:58:51,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:51,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 03:58:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:51,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 03:58:51,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-11-23 03:58:51,052 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 03:58:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:52,242 INFO L93 Difference]: Finished difference Result 197 states and 243 transitions. [2022-11-23 03:58:52,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:58:52,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-23 03:58:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:52,243 INFO L225 Difference]: With dead ends: 197 [2022-11-23 03:58:52,244 INFO L226 Difference]: Without dead ends: 122 [2022-11-23 03:58:52,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-11-23 03:58:52,245 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 77 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:52,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 278 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 03:58:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-23 03:58:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2022-11-23 03:58:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 76 states have internal predecessors, (89), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-11-23 03:58:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2022-11-23 03:58:52,272 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 41 [2022-11-23 03:58:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:52,272 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2022-11-23 03:58:52,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 03:58:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-11-23 03:58:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 03:58:52,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:52,273 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:58:52,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 03:58:52,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:58:52,485 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:52,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash 286987862, now seen corresponding path program 1 times [2022-11-23 03:58:52,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:52,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044786519] [2022-11-23 03:58:52,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:52,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:53,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:53,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:53,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:53,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:58:53,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:53,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044786519] [2022-11-23 03:58:53,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044786519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:53,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:53,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 03:58:53,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124174958] [2022-11-23 03:58:53,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:53,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 03:58:53,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:53,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 03:58:53,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:58:53,184 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 03:58:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:53,518 INFO L93 Difference]: Finished difference Result 188 states and 236 transitions. [2022-11-23 03:58:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:58:53,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-11-23 03:58:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:53,520 INFO L225 Difference]: With dead ends: 188 [2022-11-23 03:58:53,520 INFO L226 Difference]: Without dead ends: 111 [2022-11-23 03:58:53,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:58:53,521 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 67 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:53,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 121 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:58:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-23 03:58:53,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2022-11-23 03:58:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 74 states have internal predecessors, (84), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-11-23 03:58:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-11-23 03:58:53,539 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 41 [2022-11-23 03:58:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:53,539 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-11-23 03:58:53,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 03:58:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-11-23 03:58:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-23 03:58:53,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:53,541 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:58:53,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 03:58:53,541 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:53,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash 379920541, now seen corresponding path program 1 times [2022-11-23 03:58:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:53,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208006915] [2022-11-23 03:58:53,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:53,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:54,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:54,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:54,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:58:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:54,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208006915] [2022-11-23 03:58:54,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208006915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:54,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:54,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-23 03:58:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080779861] [2022-11-23 03:58:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:54,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 03:58:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:54,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 03:58:54,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-23 03:58:54,490 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 03:58:55,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:58:55,063 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2022-11-23 03:58:55,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 03:58:55,064 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-11-23 03:58:55,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:58:55,065 INFO L225 Difference]: With dead ends: 120 [2022-11-23 03:58:55,065 INFO L226 Difference]: Without dead ends: 118 [2022-11-23 03:58:55,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-11-23 03:58:55,067 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 71 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:58:55,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 316 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 03:58:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-23 03:58:55,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2022-11-23 03:58:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.178082191780822) internal successors, (86), 76 states have internal predecessors, (86), 16 states have call successors, (16), 8 states have call predecessors, (16), 10 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2022-11-23 03:58:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2022-11-23 03:58:55,084 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 43 [2022-11-23 03:58:55,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:58:55,084 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2022-11-23 03:58:55,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-23 03:58:55,085 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2022-11-23 03:58:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-23 03:58:55,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:58:55,087 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:58:55,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 03:58:55,088 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:58:55,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:58:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1080985119, now seen corresponding path program 1 times [2022-11-23 03:58:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:58:55,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507940522] [2022-11-23 03:58:55,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:58:55,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:58:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:58,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:58:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:58,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:58:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-23 03:58:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:58,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-23 03:58:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:58:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:58:59,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:58:59,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507940522] [2022-11-23 03:58:59,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507940522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:58:59,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:58:59,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-23 03:58:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166759305] [2022-11-23 03:58:59,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:58:59,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 03:58:59,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:58:59,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 03:58:59,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2022-11-23 03:58:59,042 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 20 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 03:59:00,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:00,990 INFO L93 Difference]: Finished difference Result 132 states and 154 transitions. [2022-11-23 03:59:00,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 03:59:00,990 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2022-11-23 03:59:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:00,991 INFO L225 Difference]: With dead ends: 132 [2022-11-23 03:59:00,995 INFO L226 Difference]: Without dead ends: 130 [2022-11-23 03:59:00,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=1148, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 03:59:00,996 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 117 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:00,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 382 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-23 03:59:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-23 03:59:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2022-11-23 03:59:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 15 states have call successors, (15), 8 states have call predecessors, (15), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-11-23 03:59:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-11-23 03:59:01,013 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 43 [2022-11-23 03:59:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:01,014 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-11-23 03:59:01,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-23 03:59:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-11-23 03:59:01,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-23 03:59:01,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:01,016 INFO L195 NwaCegarLoop]: trace histogram [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-23 03:59:01,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 03:59:01,017 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash -471568136, now seen corresponding path program 1 times [2022-11-23 03:59:01,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:01,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962346999] [2022-11-23 03:59:01,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:01,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:01,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:01,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 03:59:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:01,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 03:59:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:01,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 03:59:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:01,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 03:59:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:59:01,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:01,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962346999] [2022-11-23 03:59:01,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962346999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:59:01,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:59:01,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 03:59:01,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646280874] [2022-11-23 03:59:01,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:59:01,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 03:59:01,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:01,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 03:59:01,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:59:01,538 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-23 03:59:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:01,861 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2022-11-23 03:59:01,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 03:59:01,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2022-11-23 03:59:01,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:01,863 INFO L225 Difference]: With dead ends: 125 [2022-11-23 03:59:01,863 INFO L226 Difference]: Without dead ends: 93 [2022-11-23 03:59:01,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-23 03:59:01,864 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 103 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:01,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 87 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 03:59:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-23 03:59:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-23 03:59:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 70 states have internal predecessors, (80), 15 states have call successors, (15), 8 states have call predecessors, (15), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-11-23 03:59:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2022-11-23 03:59:01,890 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 52 [2022-11-23 03:59:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:01,891 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2022-11-23 03:59:01,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-23 03:59:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2022-11-23 03:59:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-23 03:59:01,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:01,893 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:59:01,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 03:59:01,894 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:01,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:01,894 INFO L85 PathProgramCache]: Analyzing trace with hash 416252355, now seen corresponding path program 1 times [2022-11-23 03:59:01,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:01,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702750778] [2022-11-23 03:59:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:01,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:02,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:02,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 03:59:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:02,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 03:59:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:02,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 03:59:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:02,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 03:59:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 03:59:02,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:02,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702750778] [2022-11-23 03:59:02,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702750778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:59:02,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:59:02,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 03:59:02,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851066872] [2022-11-23 03:59:02,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:59:02,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 03:59:02,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:02,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 03:59:02,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-23 03:59:02,688 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-23 03:59:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:03,193 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2022-11-23 03:59:03,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 03:59:03,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2022-11-23 03:59:03,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:03,194 INFO L225 Difference]: With dead ends: 109 [2022-11-23 03:59:03,195 INFO L226 Difference]: Without dead ends: 107 [2022-11-23 03:59:03,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-23 03:59:03,195 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 60 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:03,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 240 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 03:59:03,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-23 03:59:03,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2022-11-23 03:59:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.155844155844156) internal successors, (89), 81 states have internal predecessors, (89), 16 states have call successors, (16), 9 states have call predecessors, (16), 12 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2022-11-23 03:59:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2022-11-23 03:59:03,206 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 58 [2022-11-23 03:59:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:03,206 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2022-11-23 03:59:03,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-23 03:59:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2022-11-23 03:59:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 03:59:03,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:03,208 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:59:03,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 03:59:03,208 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:03,209 INFO L85 PathProgramCache]: Analyzing trace with hash 361728585, now seen corresponding path program 1 times [2022-11-23 03:59:03,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:03,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028959623] [2022-11-23 03:59:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:03,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:06,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:06,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 03:59:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:06,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:06,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 03:59:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:06,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 03:59:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 03:59:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 03:59:06,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:06,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028959623] [2022-11-23 03:59:06,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028959623] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:06,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690119987] [2022-11-23 03:59:06,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:06,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:06,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:59:06,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:59:06,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 03:59:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:07,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 2504 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-23 03:59:07,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:59:07,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 03:59:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:59:09,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:59:09,713 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 03:59:09,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 1 [2022-11-23 03:59:10,212 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-23 03:59:10,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-11-23 03:59:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:59:10,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690119987] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:59:10,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:59:10,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 14] total 38 [2022-11-23 03:59:10,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169252032] [2022-11-23 03:59:10,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:59:10,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 03:59:10,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:10,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 03:59:10,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1272, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 03:59:10,306 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand has 38 states, 33 states have (on average 2.727272727272727) internal successors, (90), 31 states have internal predecessors, (90), 9 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-23 03:59:15,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:15,179 INFO L93 Difference]: Finished difference Result 246 states and 288 transitions. [2022-11-23 03:59:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 03:59:15,180 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 2.727272727272727) internal successors, (90), 31 states have internal predecessors, (90), 9 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) Word has length 62 [2022-11-23 03:59:15,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:15,182 INFO L225 Difference]: With dead ends: 246 [2022-11-23 03:59:15,183 INFO L226 Difference]: Without dead ends: 206 [2022-11-23 03:59:15,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=590, Invalid=3192, Unknown=0, NotChecked=0, Total=3782 [2022-11-23 03:59:15,185 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 399 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 2046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:15,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 294 Invalid, 2046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-23 03:59:15,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-23 03:59:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 144. [2022-11-23 03:59:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 109 states have (on average 1.1743119266055047) internal successors, (128), 114 states have internal predecessors, (128), 18 states have call successors, (18), 11 states have call predecessors, (18), 16 states have return successors, (23), 18 states have call predecessors, (23), 17 states have call successors, (23) [2022-11-23 03:59:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2022-11-23 03:59:15,199 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 62 [2022-11-23 03:59:15,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:15,200 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2022-11-23 03:59:15,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 2.727272727272727) internal successors, (90), 31 states have internal predecessors, (90), 9 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (14), 7 states have call predecessors, (14), 8 states have call successors, (14) [2022-11-23 03:59:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2022-11-23 03:59:15,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 03:59:15,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:15,201 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:59:15,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 03:59:15,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 03:59:15,410 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash -918135093, now seen corresponding path program 1 times [2022-11-23 03:59:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:15,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136013368] [2022-11-23 03:59:15,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:15,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:16,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:16,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 03:59:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:16,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:16,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 03:59:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:16,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 03:59:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:16,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 03:59:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 03:59:17,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:17,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136013368] [2022-11-23 03:59:17,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136013368] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:17,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391211506] [2022-11-23 03:59:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:17,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:17,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:59:17,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:59:17,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 03:59:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:17,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 2499 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-23 03:59:17,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:59:17,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:17,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:17,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 03:59:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:59:18,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:59:19,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 346 treesize of output 334 [2022-11-23 03:59:20,064 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:59:20,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391211506] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:59:20,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:59:20,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 14] total 38 [2022-11-23 03:59:20,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410149122] [2022-11-23 03:59:20,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:59:20,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 03:59:20,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:20,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 03:59:20,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1264, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 03:59:20,068 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 38 states, 34 states have (on average 2.5) internal successors, (85), 31 states have internal predecessors, (85), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-23 03:59:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:23,817 INFO L93 Difference]: Finished difference Result 316 states and 365 transitions. [2022-11-23 03:59:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 03:59:23,818 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 34 states have (on average 2.5) internal successors, (85), 31 states have internal predecessors, (85), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 62 [2022-11-23 03:59:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:23,821 INFO L225 Difference]: With dead ends: 316 [2022-11-23 03:59:23,821 INFO L226 Difference]: Without dead ends: 266 [2022-11-23 03:59:23,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=408, Invalid=2779, Unknown=5, NotChecked=0, Total=3192 [2022-11-23 03:59:23,828 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 568 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 110 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:23,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 193 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1934 Invalid, 13 Unknown, 0 Unchecked, 2.3s Time] [2022-11-23 03:59:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-23 03:59:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 183. [2022-11-23 03:59:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 141 states have (on average 1.1702127659574468) internal successors, (165), 148 states have internal predecessors, (165), 20 states have call successors, (20), 13 states have call predecessors, (20), 21 states have return successors, (29), 21 states have call predecessors, (29), 19 states have call successors, (29) [2022-11-23 03:59:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 214 transitions. [2022-11-23 03:59:23,855 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 214 transitions. Word has length 62 [2022-11-23 03:59:23,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:23,855 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 214 transitions. [2022-11-23 03:59:23,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 34 states have (on average 2.5) internal successors, (85), 31 states have internal predecessors, (85), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-23 03:59:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 214 transitions. [2022-11-23 03:59:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 03:59:23,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:23,857 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:59:23,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-23 03:59:24,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 03:59:24,067 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:24,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1530318863, now seen corresponding path program 1 times [2022-11-23 03:59:24,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:24,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838669890] [2022-11-23 03:59:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:24,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:25,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:25,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:25,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 03:59:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:26,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 03:59:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:26,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 03:59:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:26,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 03:59:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:59:26,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:26,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838669890] [2022-11-23 03:59:26,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838669890] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:26,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555497613] [2022-11-23 03:59:26,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:26,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:26,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:59:26,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:59:26,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 03:59:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:27,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 2501 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-23 03:59:27,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:59:27,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:27,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:27,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 03:59:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:59:28,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:59:30,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:59:30,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11586 treesize of output 1 [2022-11-23 03:59:30,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555497613] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:30,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:59:30,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 37 [2022-11-23 03:59:30,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777078606] [2022-11-23 03:59:30,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:59:30,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-23 03:59:30,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:30,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-23 03:59:30,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2000, Unknown=0, NotChecked=0, Total=2162 [2022-11-23 03:59:30,458 INFO L87 Difference]: Start difference. First operand 183 states and 214 transitions. Second operand has 37 states, 32 states have (on average 2.3125) internal successors, (74), 30 states have internal predecessors, (74), 11 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-11-23 03:59:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:38,271 INFO L93 Difference]: Finished difference Result 302 states and 347 transitions. [2022-11-23 03:59:38,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-23 03:59:38,271 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 32 states have (on average 2.3125) internal successors, (74), 30 states have internal predecessors, (74), 11 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) Word has length 62 [2022-11-23 03:59:38,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:38,276 INFO L225 Difference]: With dead ends: 302 [2022-11-23 03:59:38,276 INFO L226 Difference]: Without dead ends: 263 [2022-11-23 03:59:38,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1686 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=693, Invalid=6776, Unknown=13, NotChecked=0, Total=7482 [2022-11-23 03:59:38,279 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 516 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 3238 mSolverCounterSat, 154 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 3404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 3238 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:38,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 290 Invalid, 3404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 3238 Invalid, 12 Unknown, 0 Unchecked, 4.4s Time] [2022-11-23 03:59:38,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-11-23 03:59:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 185. [2022-11-23 03:59:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 143 states have (on average 1.1608391608391608) internal successors, (166), 150 states have internal predecessors, (166), 20 states have call successors, (20), 13 states have call predecessors, (20), 21 states have return successors, (29), 21 states have call predecessors, (29), 19 states have call successors, (29) [2022-11-23 03:59:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 215 transitions. [2022-11-23 03:59:38,305 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 215 transitions. Word has length 62 [2022-11-23 03:59:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:38,306 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 215 transitions. [2022-11-23 03:59:38,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 32 states have (on average 2.3125) internal successors, (74), 30 states have internal predecessors, (74), 11 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-11-23 03:59:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 215 transitions. [2022-11-23 03:59:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 03:59:38,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:38,308 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:59:38,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 03:59:38,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 03:59:38,518 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:38,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1953106119, now seen corresponding path program 1 times [2022-11-23 03:59:38,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:38,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244585059] [2022-11-23 03:59:38,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:38,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:38,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:38,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:38,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 03:59:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:38,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:38,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 03:59:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:38,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 03:59:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:38,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 03:59:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 03:59:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244585059] [2022-11-23 03:59:38,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244585059] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:38,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618792782] [2022-11-23 03:59:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:38,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:38,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:59:38,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:59:38,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 03:59:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:39,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 2491 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 03:59:39,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:59:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 03:59:39,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 03:59:39,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618792782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:59:39,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 03:59:39,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-11-23 03:59:39,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42375591] [2022-11-23 03:59:39,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:59:39,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:59:39,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:39,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:59:39,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 03:59:39,342 INFO L87 Difference]: Start difference. First operand 185 states and 215 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-23 03:59:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:39,378 INFO L93 Difference]: Finished difference Result 231 states and 267 transitions. [2022-11-23 03:59:39,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 03:59:39,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2022-11-23 03:59:39,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:39,380 INFO L225 Difference]: With dead ends: 231 [2022-11-23 03:59:39,380 INFO L226 Difference]: Without dead ends: 147 [2022-11-23 03:59:39,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 03:59:39,381 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 20 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 232 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-23 03:59:39,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 232 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 03:59:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-23 03:59:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2022-11-23 03:59:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 109 states have internal predecessors, (118), 18 states have call successors, (18), 11 states have call predecessors, (18), 15 states have return successors, (22), 18 states have call predecessors, (22), 17 states have call successors, (22) [2022-11-23 03:59:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2022-11-23 03:59:39,406 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 62 [2022-11-23 03:59:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:39,406 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2022-11-23 03:59:39,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-23 03:59:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2022-11-23 03:59:39,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-23 03:59:39,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:39,408 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 03:59:39,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 03:59:39,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 03:59:39,617 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:39,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash -357159951, now seen corresponding path program 1 times [2022-11-23 03:59:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:39,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105885902] [2022-11-23 03:59:39,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:39,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:41,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:41,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:41,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 03:59:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:41,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:41,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 03:59:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:41,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 03:59:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:42,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 03:59:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:42,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-23 03:59:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 03:59:42,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:42,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105885902] [2022-11-23 03:59:42,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105885902] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:42,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291197144] [2022-11-23 03:59:42,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:42,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:42,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:59:42,029 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:59:42,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 03:59:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:42,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 2508 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-23 03:59:42,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:59:42,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 03:59:43,027 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 03:59:43,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-11-23 03:59:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-23 03:59:43,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:59:43,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 814 treesize of output 798 [2022-11-23 03:59:44,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291197144] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:44,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 03:59:44,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2022-11-23 03:59:44,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220657503] [2022-11-23 03:59:44,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 03:59:44,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-23 03:59:44,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:44,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-23 03:59:44,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 03:59:44,026 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand has 28 states, 25 states have (on average 2.28) internal successors, (57), 21 states have internal predecessors, (57), 9 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-23 03:59:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:47,328 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2022-11-23 03:59:47,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 03:59:47,329 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.28) internal successors, (57), 21 states have internal predecessors, (57), 9 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) Word has length 64 [2022-11-23 03:59:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:47,330 INFO L225 Difference]: With dead ends: 171 [2022-11-23 03:59:47,331 INFO L226 Difference]: Without dead ends: 169 [2022-11-23 03:59:47,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=281, Invalid=2911, Unknown=0, NotChecked=0, Total=3192 [2022-11-23 03:59:47,332 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 288 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 80 mSolverCounterUnsat, 57 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 57 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:47,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 289 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1645 Invalid, 57 Unknown, 0 Unchecked, 2.1s Time] [2022-11-23 03:59:47,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-23 03:59:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2022-11-23 03:59:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 108 states have (on average 1.1203703703703705) internal successors, (121), 112 states have internal predecessors, (121), 18 states have call successors, (18), 12 states have call predecessors, (18), 16 states have return successors, (22), 18 states have call predecessors, (22), 17 states have call successors, (22) [2022-11-23 03:59:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2022-11-23 03:59:47,355 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 64 [2022-11-23 03:59:47,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:47,355 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2022-11-23 03:59:47,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.28) internal successors, (57), 21 states have internal predecessors, (57), 9 states have call successors, (15), 4 states have call predecessors, (15), 6 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-23 03:59:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2022-11-23 03:59:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-23 03:59:47,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:47,357 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:59:47,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 03:59:47,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:47,566 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:47,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:47,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1477485396, now seen corresponding path program 1 times [2022-11-23 03:59:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:47,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276173106] [2022-11-23 03:59:47,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:47,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:48,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:48,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:48,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 03:59:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 03:59:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 03:59:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:48,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 03:59:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 03:59:48,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:48,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276173106] [2022-11-23 03:59:48,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276173106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:59:48,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:59:48,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 03:59:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225785413] [2022-11-23 03:59:48,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:59:48,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 03:59:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 03:59:48,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-23 03:59:48,300 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-23 03:59:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 03:59:48,973 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2022-11-23 03:59:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 03:59:48,975 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-11-23 03:59:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 03:59:48,977 INFO L225 Difference]: With dead ends: 169 [2022-11-23 03:59:48,977 INFO L226 Difference]: Without dead ends: 167 [2022-11-23 03:59:48,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-11-23 03:59:48,980 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 69 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 03:59:48,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 302 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 03:59:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-23 03:59:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2022-11-23 03:59:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 120 states have (on average 1.1083333333333334) internal successors, (133), 126 states have internal predecessors, (133), 18 states have call successors, (18), 12 states have call predecessors, (18), 18 states have return successors, (25), 18 states have call predecessors, (25), 17 states have call successors, (25) [2022-11-23 03:59:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 176 transitions. [2022-11-23 03:59:49,013 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 176 transitions. Word has length 64 [2022-11-23 03:59:49,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 03:59:49,013 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 176 transitions. [2022-11-23 03:59:49,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-23 03:59:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 176 transitions. [2022-11-23 03:59:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-23 03:59:49,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 03:59:49,021 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-23 03:59:49,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 03:59:49,022 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 03:59:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:59:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2116417322, now seen corresponding path program 1 times [2022-11-23 03:59:49,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:59:49,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192023288] [2022-11-23 03:59:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:49,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:59:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:50,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 03:59:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:50,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:50,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 03:59:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 03:59:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:50,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 03:59:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:50,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 03:59:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:50,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 03:59:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 03:59:50,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:59:50,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192023288] [2022-11-23 03:59:50,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192023288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:59:50,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180892094] [2022-11-23 03:59:50,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:59:50,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:59:50,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:59:50,834 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:59:50,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 03:59:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:59:51,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 2511 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-23 03:59:51,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:59:51,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:51,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:59:51,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 03:59:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:59:52,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:59:52,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3036 treesize of output 2940 [2022-11-23 03:59:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 03:59:57,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180892094] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:59:57,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:59:57,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 13] total 34 [2022-11-23 03:59:57,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078093920] [2022-11-23 03:59:57,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:59:57,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-23 03:59:57,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:59:57,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-23 03:59:57,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2022-11-23 03:59:57,180 INFO L87 Difference]: Start difference. First operand 157 states and 176 transitions. Second operand has 34 states, 30 states have (on average 3.1) internal successors, (93), 27 states have internal predecessors, (93), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-23 04:00:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:00:01,117 INFO L93 Difference]: Finished difference Result 269 states and 297 transitions. [2022-11-23 04:00:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-23 04:00:01,118 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 30 states have (on average 3.1) internal successors, (93), 27 states have internal predecessors, (93), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 64 [2022-11-23 04:00:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:00:01,119 INFO L225 Difference]: With dead ends: 269 [2022-11-23 04:00:01,119 INFO L226 Difference]: Without dead ends: 224 [2022-11-23 04:00:01,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 118 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=410, Invalid=2665, Unknown=5, NotChecked=0, Total=3080 [2022-11-23 04:00:01,121 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 483 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 120 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-23 04:00:01,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 212 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2050 Invalid, 7 Unknown, 0 Unchecked, 2.4s Time] [2022-11-23 04:00:01,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-23 04:00:01,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 155. [2022-11-23 04:00:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 119 states have (on average 1.1092436974789917) internal successors, (132), 124 states have internal predecessors, (132), 18 states have call successors, (18), 12 states have call predecessors, (18), 17 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2022-11-23 04:00:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2022-11-23 04:00:01,144 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 64 [2022-11-23 04:00:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:00:01,145 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2022-11-23 04:00:01,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 30 states have (on average 3.1) internal successors, (93), 27 states have internal predecessors, (93), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-23 04:00:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2022-11-23 04:00:01,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-23 04:00:01,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:00:01,146 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:00:01,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 04:00:01,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:00:01,357 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:00:01,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1604664163, now seen corresponding path program 1 times [2022-11-23 04:00:01,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:00:01,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870553712] [2022-11-23 04:00:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:00:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:03,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 04:00:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:00:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:03,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 04:00:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:03,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:00:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:03,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 04:00:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:03,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 04:00:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:04,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 04:00:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:04,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-23 04:00:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:04,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 04:00:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-23 04:00:04,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:00:04,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870553712] [2022-11-23 04:00:04,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870553712] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:00:04,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940731251] [2022-11-23 04:00:04,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:04,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:00:04,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 04:00:04,043 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 04:00:04,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 04:00:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:04,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 2519 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-23 04:00:04,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:04,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:04,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:04,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 04:00:06,719 INFO L321 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2022-11-23 04:00:06,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 34 [2022-11-23 04:00:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 04:00:06,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 04:00:07,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3208 treesize of output 3112 [2022-11-23 04:00:08,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940731251] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:00:08,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 04:00:08,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 35 [2022-11-23 04:00:08,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082828807] [2022-11-23 04:00:08,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 04:00:08,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-23 04:00:08,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:00:08,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-23 04:00:08,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1679, Unknown=0, NotChecked=0, Total=1806 [2022-11-23 04:00:08,268 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand has 35 states, 30 states have (on average 2.566666666666667) internal successors, (77), 27 states have internal predecessors, (77), 10 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) [2022-11-23 04:00:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:00:16,230 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2022-11-23 04:00:16,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-23 04:00:16,231 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 2.566666666666667) internal successors, (77), 27 states have internal predecessors, (77), 10 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) Word has length 70 [2022-11-23 04:00:16,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:00:16,232 INFO L225 Difference]: With dead ends: 239 [2022-11-23 04:00:16,232 INFO L226 Difference]: Without dead ends: 237 [2022-11-23 04:00:16,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 97 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=628, Invalid=5842, Unknown=10, NotChecked=0, Total=6480 [2022-11-23 04:00:16,235 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 426 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 116 mSolverCounterUnsat, 79 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 2719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 79 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-23 04:00:16,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 286 Invalid, 2719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2524 Invalid, 79 Unknown, 0 Unchecked, 3.5s Time] [2022-11-23 04:00:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-23 04:00:16,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 194. [2022-11-23 04:00:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 144 states have (on average 1.0972222222222223) internal successors, (158), 149 states have internal predecessors, (158), 26 states have call successors, (26), 18 states have call predecessors, (26), 23 states have return successors, (31), 26 states have call predecessors, (31), 24 states have call successors, (31) [2022-11-23 04:00:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2022-11-23 04:00:16,279 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 70 [2022-11-23 04:00:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:00:16,279 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2022-11-23 04:00:16,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 2.566666666666667) internal successors, (77), 27 states have internal predecessors, (77), 10 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) [2022-11-23 04:00:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2022-11-23 04:00:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-23 04:00:16,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:00:16,282 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:00:16,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 04:00:16,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:00:16,487 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:00:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:16,487 INFO L85 PathProgramCache]: Analyzing trace with hash 809840792, now seen corresponding path program 1 times [2022-11-23 04:00:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:00:16,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294021004] [2022-11-23 04:00:16,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:00:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 04:00:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:19,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:00:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:19,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 04:00:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:19,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:00:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:19,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 04:00:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-23 04:00:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:19,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 04:00:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 04:00:19,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:00:19,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294021004] [2022-11-23 04:00:19,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294021004] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:00:19,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642331573] [2022-11-23 04:00:19,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:19,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:00:19,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 04:00:19,965 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 04:00:19,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 04:00:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:20,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-23 04:00:20,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:20,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:20,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:20,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 04:00:21,238 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-23 04:00:21,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 21 [2022-11-23 04:00:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 04:00:21,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 04:00:21,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642331573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:00:21,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 04:00:21,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [24] total 32 [2022-11-23 04:00:21,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132036580] [2022-11-23 04:00:21,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:00:21,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 04:00:21,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:00:21,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 04:00:21,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2022-11-23 04:00:21,248 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 04:00:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:00:22,333 INFO L93 Difference]: Finished difference Result 326 states and 361 transitions. [2022-11-23 04:00:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 04:00:22,335 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 68 [2022-11-23 04:00:22,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:00:22,336 INFO L225 Difference]: With dead ends: 326 [2022-11-23 04:00:22,336 INFO L226 Difference]: Without dead ends: 220 [2022-11-23 04:00:22,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=1253, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 04:00:22,338 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 115 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 04:00:22,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 348 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 04:00:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-23 04:00:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 188. [2022-11-23 04:00:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 139 states have (on average 1.1007194244604317) internal successors, (153), 143 states have internal predecessors, (153), 26 states have call successors, (26), 18 states have call predecessors, (26), 22 states have return successors, (29), 26 states have call predecessors, (29), 24 states have call successors, (29) [2022-11-23 04:00:22,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 208 transitions. [2022-11-23 04:00:22,374 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 208 transitions. Word has length 68 [2022-11-23 04:00:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:00:22,374 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 208 transitions. [2022-11-23 04:00:22,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 04:00:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 208 transitions. [2022-11-23 04:00:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-23 04:00:22,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:00:22,375 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:00:22,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 04:00:22,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-23 04:00:22,585 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:00:22,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:22,585 INFO L85 PathProgramCache]: Analyzing trace with hash 415474006, now seen corresponding path program 1 times [2022-11-23 04:00:22,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:00:22,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792005672] [2022-11-23 04:00:22,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:22,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:00:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:23,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 04:00:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:23,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:00:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:23,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 04:00:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:00:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:23,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 04:00:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:24,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-23 04:00:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:24,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 04:00:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 04:00:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:00:24,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792005672] [2022-11-23 04:00:24,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792005672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:00:24,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725692271] [2022-11-23 04:00:24,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:24,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:00:24,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 04:00:24,383 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 04:00:24,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 04:00:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:24,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 2518 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-23 04:00:24,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:25,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:25,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:25,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 04:00:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 04:00:26,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 04:00:26,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 792 treesize of output 768 [2022-11-23 04:00:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 04:00:27,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725692271] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 04:00:27,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 04:00:27,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 35 [2022-11-23 04:00:27,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26281340] [2022-11-23 04:00:27,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 04:00:27,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-23 04:00:27,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:00:27,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-23 04:00:27,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 04:00:27,164 INFO L87 Difference]: Start difference. First operand 188 states and 208 transitions. Second operand has 35 states, 31 states have (on average 3.096774193548387) internal successors, (96), 28 states have internal predecessors, (96), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-23 04:00:29,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:00:32,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:00:34,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:00:34,973 INFO L93 Difference]: Finished difference Result 292 states and 318 transitions. [2022-11-23 04:00:34,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 04:00:34,976 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 3.096774193548387) internal successors, (96), 28 states have internal predecessors, (96), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 68 [2022-11-23 04:00:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:00:34,977 INFO L225 Difference]: With dead ends: 292 [2022-11-23 04:00:34,977 INFO L226 Difference]: Without dead ends: 193 [2022-11-23 04:00:34,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 128 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=377, Invalid=2485, Unknown=0, NotChecked=0, Total=2862 [2022-11-23 04:00:34,979 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 324 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 74 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-23 04:00:34,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 363 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1864 Invalid, 13 Unknown, 0 Unchecked, 6.3s Time] [2022-11-23 04:00:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-23 04:00:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2022-11-23 04:00:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 132 states have (on average 1.0606060606060606) internal successors, (140), 134 states have internal predecessors, (140), 25 states have call successors, (25), 18 states have call predecessors, (25), 20 states have return successors, (25), 25 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-23 04:00:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 190 transitions. [2022-11-23 04:00:35,016 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 190 transitions. Word has length 68 [2022-11-23 04:00:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:00:35,017 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 190 transitions. [2022-11-23 04:00:35,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 3.096774193548387) internal successors, (96), 28 states have internal predecessors, (96), 9 states have call successors, (15), 5 states have call predecessors, (15), 8 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-11-23 04:00:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 190 transitions. [2022-11-23 04:00:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-23 04:00:35,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:00:35,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:00:35,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 04:00:35,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:00:35,229 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:00:35,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:35,230 INFO L85 PathProgramCache]: Analyzing trace with hash -864389672, now seen corresponding path program 1 times [2022-11-23 04:00:35,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:00:35,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056990507] [2022-11-23 04:00:35,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:00:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:38,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 04:00:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:00:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:38,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 04:00:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:38,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:00:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:38,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 04:00:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:38,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-23 04:00:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:38,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 04:00:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 04:00:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:00:38,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056990507] [2022-11-23 04:00:38,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056990507] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:00:38,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933012444] [2022-11-23 04:00:38,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:38,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:00:38,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 04:00:38,926 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 04:00:38,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 04:00:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:00:40,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 2513 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-23 04:00:40,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:00:40,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:40,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:00:40,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 04:00:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 04:00:41,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 04:00:42,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 343 treesize of output 331 [2022-11-23 04:00:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 04:00:42,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933012444] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 04:00:42,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 04:00:42,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 13] total 40 [2022-11-23 04:00:42,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927354928] [2022-11-23 04:00:42,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 04:00:42,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-23 04:00:42,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:00:42,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-23 04:00:42,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1406, Unknown=0, NotChecked=0, Total=1560 [2022-11-23 04:00:42,749 INFO L87 Difference]: Start difference. First operand 178 states and 190 transitions. Second operand has 40 states, 34 states have (on average 3.6470588235294117) internal successors, (124), 32 states have internal predecessors, (124), 11 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) [2022-11-23 04:00:45,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:00:47,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:00:49,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:00:52,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:00:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:00:57,265 INFO L93 Difference]: Finished difference Result 241 states and 256 transitions. [2022-11-23 04:00:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-23 04:00:57,266 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 3.6470588235294117) internal successors, (124), 32 states have internal predecessors, (124), 11 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) Word has length 68 [2022-11-23 04:00:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:00:57,268 INFO L225 Difference]: With dead ends: 241 [2022-11-23 04:00:57,268 INFO L226 Difference]: Without dead ends: 194 [2022-11-23 04:00:57,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 126 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=646, Invalid=3776, Unknown=0, NotChecked=0, Total=4422 [2022-11-23 04:00:57,270 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 355 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 2746 mSolverCounterSat, 109 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2746 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-11-23 04:00:57,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 422 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2746 Invalid, 10 Unknown, 0 Unchecked, 11.7s Time] [2022-11-23 04:00:57,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-23 04:00:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2022-11-23 04:00:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.0551181102362204) internal successors, (134), 129 states have internal predecessors, (134), 25 states have call successors, (25), 18 states have call predecessors, (25), 20 states have return successors, (25), 25 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-23 04:00:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 184 transitions. [2022-11-23 04:00:57,309 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 184 transitions. Word has length 68 [2022-11-23 04:00:57,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:00:57,309 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 184 transitions. [2022-11-23 04:00:57,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 3.6470588235294117) internal successors, (124), 32 states have internal predecessors, (124), 11 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) [2022-11-23 04:00:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 184 transitions. [2022-11-23 04:00:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-23 04:00:57,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:00:57,311 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:00:57,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 04:00:57,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-23 04:00:57,519 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:00:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:00:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1584064284, now seen corresponding path program 1 times [2022-11-23 04:00:57,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:00:57,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161312052] [2022-11-23 04:00:57,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:00:57,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:00:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:00,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 04:01:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:00,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:01:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 04:01:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:01,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:01:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:01,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 04:01:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:01,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-23 04:01:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:01,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 04:01:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 04:01:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:01:01,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161312052] [2022-11-23 04:01:01,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161312052] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:01:01,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570199874] [2022-11-23 04:01:01,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:01:01,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:01:01,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 04:01:01,728 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 04:01:01,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 04:01:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:02,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 2515 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-23 04:01:02,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:01:02,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:01:02,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:01:02,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 04:01:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 04:01:03,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 04:01:03,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570199874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:01:03,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 04:01:03,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 27 [2022-11-23 04:01:03,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059977821] [2022-11-23 04:01:03,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:01:03,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 04:01:03,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:01:03,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 04:01:03,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-11-23 04:01:03,524 INFO L87 Difference]: Start difference. First operand 173 states and 184 transitions. Second operand has 13 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-23 04:01:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:01:05,197 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2022-11-23 04:01:05,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 04:01:05,198 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 68 [2022-11-23 04:01:05,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:01:05,199 INFO L225 Difference]: With dead ends: 213 [2022-11-23 04:01:05,199 INFO L226 Difference]: Without dead ends: 175 [2022-11-23 04:01:05,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 04:01:05,200 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 51 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 04:01:05,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 469 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-23 04:01:05,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-23 04:01:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2022-11-23 04:01:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.047244094488189) internal successors, (133), 129 states have internal predecessors, (133), 25 states have call successors, (25), 18 states have call predecessors, (25), 20 states have return successors, (25), 25 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-23 04:01:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2022-11-23 04:01:05,234 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 68 [2022-11-23 04:01:05,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:01:05,235 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2022-11-23 04:01:05,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-23 04:01:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2022-11-23 04:01:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-23 04:01:05,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:01:05,236 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:01:05,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 04:01:05,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-23 04:01:05,447 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:01:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:01:05,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2006675293, now seen corresponding path program 1 times [2022-11-23 04:01:05,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:01:05,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057622387] [2022-11-23 04:01:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:01:05,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:01:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:07,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 04:01:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:07,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:01:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:07,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 04:01:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:07,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:01:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:07,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 04:01:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:08,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-23 04:01:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 04:01:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 04:01:08,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:01:08,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057622387] [2022-11-23 04:01:08,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057622387] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:01:08,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281003774] [2022-11-23 04:01:08,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:01:08,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:01:08,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 04:01:08,508 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 04:01:08,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 04:01:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:09,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 2525 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-23 04:01:09,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:01:09,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:01:09,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:01:09,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 04:01:09,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:01:09,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:01:09,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:01:09,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-11-23 04:01:10,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 04:01:10,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 54 [2022-11-23 04:01:12,253 INFO L321 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2022-11-23 04:01:12,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 58 [2022-11-23 04:01:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 04:01:12,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 04:01:13,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 04:01:13,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 56 treesize of output 96 [2022-11-23 04:01:13,967 INFO L321 Elim1Store]: treesize reduction 3, result has 93.6 percent of original size [2022-11-23 04:01:13,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 114 [2022-11-23 04:01:13,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 04:01:13,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 110 [2022-11-23 04:01:14,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281003774] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:01:14,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 04:01:14,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 49 [2022-11-23 04:01:14,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451274201] [2022-11-23 04:01:14,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 04:01:14,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-23 04:01:14,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:01:14,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-23 04:01:14,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3732, Unknown=0, NotChecked=0, Total=3906 [2022-11-23 04:01:14,523 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand has 49 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 37 states have internal predecessors, (91), 10 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2022-11-23 04:01:19,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:01:24,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:01:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:01:33,997 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2022-11-23 04:01:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-23 04:01:33,998 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 37 states have internal predecessors, (91), 10 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) Word has length 70 [2022-11-23 04:01:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:01:33,999 INFO L225 Difference]: With dead ends: 183 [2022-11-23 04:01:33,999 INFO L226 Difference]: Without dead ends: 181 [2022-11-23 04:01:34,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2343 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=969, Invalid=11687, Unknown=0, NotChecked=0, Total=12656 [2022-11-23 04:01:34,002 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 260 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 4596 mSolverCounterSat, 128 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 4596 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-11-23 04:01:34,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 591 Invalid, 4726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 4596 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time] [2022-11-23 04:01:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-23 04:01:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2022-11-23 04:01:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 132 states have internal predecessors, (136), 25 states have call successors, (25), 19 states have call predecessors, (25), 21 states have return successors, (25), 25 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-23 04:01:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 186 transitions. [2022-11-23 04:01:34,040 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 186 transitions. Word has length 70 [2022-11-23 04:01:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:01:34,040 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 186 transitions. [2022-11-23 04:01:34,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 37 states have internal predecessors, (91), 10 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2022-11-23 04:01:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 186 transitions. [2022-11-23 04:01:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-23 04:01:34,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:01:34,042 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:01:34,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 04:01:34,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:01:34,251 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:01:34,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:01:34,251 INFO L85 PathProgramCache]: Analyzing trace with hash -865864377, now seen corresponding path program 1 times [2022-11-23 04:01:34,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:01:34,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354571690] [2022-11-23 04:01:34,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:01:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:01:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:35,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 04:01:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:35,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:01:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:35,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 04:01:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:01:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:35,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 04:01:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:35,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 04:01:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:35,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 04:01:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:35,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-23 04:01:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:35,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 04:01:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:35,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-23 04:01:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-23 04:01:35,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:01:35,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354571690] [2022-11-23 04:01:35,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354571690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:01:35,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:01:35,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-23 04:01:35,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627872407] [2022-11-23 04:01:35,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:01:35,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 04:01:35,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:01:35,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 04:01:35,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-23 04:01:35,363 INFO L87 Difference]: Start difference. First operand 177 states and 186 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-23 04:01:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:01:35,954 INFO L93 Difference]: Finished difference Result 187 states and 195 transitions. [2022-11-23 04:01:35,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 04:01:35,955 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 76 [2022-11-23 04:01:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:01:35,956 INFO L225 Difference]: With dead ends: 187 [2022-11-23 04:01:35,956 INFO L226 Difference]: Without dead ends: 185 [2022-11-23 04:01:35,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-23 04:01:35,957 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 75 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 04:01:35,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 151 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 04:01:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-23 04:01:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-23 04:01:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 136 states have (on average 1.0441176470588236) internal successors, (142), 138 states have internal predecessors, (142), 25 states have call successors, (25), 21 states have call predecessors, (25), 23 states have return successors, (25), 25 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-23 04:01:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2022-11-23 04:01:36,005 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 76 [2022-11-23 04:01:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:01:36,006 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2022-11-23 04:01:36,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-23 04:01:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2022-11-23 04:01:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-23 04:01:36,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:01:36,008 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:01:36,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-23 04:01:36,009 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:01:36,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:01:36,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1177486125, now seen corresponding path program 1 times [2022-11-23 04:01:36,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:01:36,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830986093] [2022-11-23 04:01:36,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:01:36,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:01:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 04:01:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:36,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:01:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:37,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 04:01:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:37,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:01:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:37,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 04:01:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 04:01:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:37,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 04:01:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:37,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-23 04:01:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:37,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 04:01:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:37,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-23 04:01:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:37,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-23 04:01:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-23 04:01:37,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:01:37,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830986093] [2022-11-23 04:01:37,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830986093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:01:37,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:01:37,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-23 04:01:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532519213] [2022-11-23 04:01:37,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:01:37,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 04:01:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:01:37,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 04:01:37,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-23 04:01:37,077 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-23 04:01:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:01:37,632 INFO L93 Difference]: Finished difference Result 195 states and 201 transitions. [2022-11-23 04:01:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 04:01:37,633 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 83 [2022-11-23 04:01:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:01:37,634 INFO L225 Difference]: With dead ends: 195 [2022-11-23 04:01:37,634 INFO L226 Difference]: Without dead ends: 191 [2022-11-23 04:01:37,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-23 04:01:37,635 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 45 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 04:01:37,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 205 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 04:01:37,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-23 04:01:37,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-11-23 04:01:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 142 states have internal predecessors, (146), 25 states have call successors, (25), 23 states have call predecessors, (25), 24 states have return successors, (25), 25 states have call predecessors, (25), 23 states have call successors, (25) [2022-11-23 04:01:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 196 transitions. [2022-11-23 04:01:37,688 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 196 transitions. Word has length 83 [2022-11-23 04:01:37,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:01:37,690 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 196 transitions. [2022-11-23 04:01:37,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-23 04:01:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 196 transitions. [2022-11-23 04:01:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-23 04:01:37,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:01:37,693 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:01:37,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-23 04:01:37,694 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:01:37,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:01:37,694 INFO L85 PathProgramCache]: Analyzing trace with hash 896566141, now seen corresponding path program 1 times [2022-11-23 04:01:37,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:01:37,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001465631] [2022-11-23 04:01:37,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:01:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:01:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:38,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 04:01:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:01:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:38,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 04:01:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:01:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:39,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 04:01:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-23 04:01:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 04:01:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-23 04:01:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:39,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-23 04:01:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-23 04:01:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:01:39,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001465631] [2022-11-23 04:01:39,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001465631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:01:39,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:01:39,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 04:01:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212683550] [2022-11-23 04:01:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:01:39,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 04:01:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:01:39,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 04:01:39,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-23 04:01:39,112 INFO L87 Difference]: Start difference. First operand 191 states and 196 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-23 04:01:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:01:39,725 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2022-11-23 04:01:39,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 04:01:39,726 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 82 [2022-11-23 04:01:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:01:39,727 INFO L225 Difference]: With dead ends: 197 [2022-11-23 04:01:39,727 INFO L226 Difference]: Without dead ends: 193 [2022-11-23 04:01:39,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-11-23 04:01:39,728 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 04:01:39,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 137 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 04:01:39,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-23 04:01:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 148. [2022-11-23 04:01:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 114 states have internal predecessors, (117), 17 states have call successors, (17), 16 states have call predecessors, (17), 17 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2022-11-23 04:01:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2022-11-23 04:01:39,768 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 82 [2022-11-23 04:01:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:01:39,768 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2022-11-23 04:01:39,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 8 states have internal predecessors, (38), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-23 04:01:39,769 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2022-11-23 04:01:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-23 04:01:39,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:01:39,770 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:01:39,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-23 04:01:39,771 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:01:39,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:01:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash -852279920, now seen corresponding path program 1 times [2022-11-23 04:01:39,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:01:39,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45220894] [2022-11-23 04:01:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:01:39,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:01:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 04:01:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:01:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 04:01:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:01:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 04:01:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-23 04:01:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-23 04:01:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-23 04:01:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-23 04:01:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-23 04:01:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-23 04:01:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-23 04:01:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-23 04:01:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-23 04:01:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-23 04:01:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:01:41,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45220894] [2022-11-23 04:01:41,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45220894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:01:41,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628392498] [2022-11-23 04:01:41,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:01:41,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 04:01:41,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 04:01:41,955 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 04:01:41,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 04:01:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:01:42,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 2607 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-23 04:01:42,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 04:01:42,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:01:42,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 04:01:42,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-23 04:01:43,953 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 04:01:43,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 14 [2022-11-23 04:01:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-23 04:01:43,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 04:01:44,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3036 treesize of output 2940 [2022-11-23 04:01:45,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628392498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 04:01:45,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 04:01:45,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-11-23 04:01:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705410884] [2022-11-23 04:01:45,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 04:01:45,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 04:01:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:01:45,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 04:01:45,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2022-11-23 04:01:45,366 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand has 24 states, 22 states have (on average 3.772727272727273) internal successors, (83), 18 states have internal predecessors, (83), 10 states have call successors, (28), 5 states have call predecessors, (28), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2022-11-23 04:01:48,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:01:52,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:01:54,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:01:56,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:01:58,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:02,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:05,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:08,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:09,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:10,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:12,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:14,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:16,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:17,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:18,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:19,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:21,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:22,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:23,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:24,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:25,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:27,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:28,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-23 04:02:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:02:28,836 INFO L93 Difference]: Finished difference Result 203 states and 206 transitions. [2022-11-23 04:02:28,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 04:02:28,837 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.772727272727273) internal successors, (83), 18 states have internal predecessors, (83), 10 states have call successors, (28), 5 states have call predecessors, (28), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 100 [2022-11-23 04:02:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:02:28,838 INFO L225 Difference]: With dead ends: 203 [2022-11-23 04:02:28,838 INFO L226 Difference]: Without dead ends: 109 [2022-11-23 04:02:28,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 167 SyntacticMatches, 13 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=251, Invalid=1911, Unknown=0, NotChecked=0, Total=2162 [2022-11-23 04:02:28,839 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 201 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 77 mSolverCounterUnsat, 48 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 48 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.4s IncrementalHoareTripleChecker+Time [2022-11-23 04:02:28,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 282 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1402 Invalid, 48 Unknown, 0 Unchecked, 36.4s Time] [2022-11-23 04:02:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-23 04:02:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-23 04:02:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.0) internal successors, (80), 80 states have internal predecessors, (80), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-23 04:02:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2022-11-23 04:02:28,872 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 100 [2022-11-23 04:02:28,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:02:28,872 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2022-11-23 04:02:28,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.772727272727273) internal successors, (83), 18 states have internal predecessors, (83), 10 states have call successors, (28), 5 states have call predecessors, (28), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2022-11-23 04:02:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2022-11-23 04:02:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-23 04:02:28,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 04:02:28,874 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 04:02:28,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 04:02:29,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-23 04:02:29,089 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 04:02:29,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 04:02:29,089 INFO L85 PathProgramCache]: Analyzing trace with hash 534230128, now seen corresponding path program 1 times [2022-11-23 04:02:29,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 04:02:29,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386208733] [2022-11-23 04:02:29,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 04:02:29,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 04:02:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:31,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-23 04:02:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:02:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:31,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-23 04:02:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-23 04:02:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-23 04:02:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:32,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-23 04:02:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:32,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-23 04:02:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:32,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-23 04:02:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:32,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-23 04:02:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:32,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-23 04:02:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:32,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-23 04:02:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:32,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-23 04:02:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-23 04:02:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:32,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-23 04:02:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 04:02:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-11-23 04:02:32,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 04:02:32,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386208733] [2022-11-23 04:02:32,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386208733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 04:02:32,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 04:02:32,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-23 04:02:32,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789199280] [2022-11-23 04:02:32,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 04:02:32,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 04:02:32,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 04:02:32,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 04:02:32,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2022-11-23 04:02:32,269 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-23 04:02:33,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 04:02:33,380 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2022-11-23 04:02:33,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 04:02:33,381 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Word has length 112 [2022-11-23 04:02:33,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 04:02:33,381 INFO L225 Difference]: With dead ends: 109 [2022-11-23 04:02:33,381 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 04:02:33,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2022-11-23 04:02:33,383 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 04:02:33,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 179 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 04:02:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 04:02:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 04:02:33,384 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-23 04:02:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 04:02:33,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2022-11-23 04:02:33,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 04:02:33,384 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 04:02:33,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.066666666666667) internal successors, (46), 12 states have internal predecessors, (46), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2022-11-23 04:02:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 04:02:33,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 04:02:33,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 04:02:33,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-23 04:02:33,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 04:02:43,904 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (or (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse0 (+ 18446744073709551615 (* (div (+ (- 1) .cse0) 18446744073709551616) 18446744073709551616)))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6|) 0))) (<= .cse1 (* 18446744073709551616 (div .cse1 18446744073709551616)))))) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse2 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse2)) (= .cse2 0))))) [2022-11-23 04:02:43,904 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2022-11-23 04:02:43,904 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2022-11-23 04:02:43,905 INFO L899 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2022-11-23 04:02:43,905 INFO L895 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (or (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (not (let ((.cse0 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse0 (+ 18446744073709551615 (* (div (+ (- 1) .cse0) 18446744073709551616) 18446744073709551616)))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6| Int)) (not (let ((.cse1 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6|) 0))) (<= .cse1 (* 18446744073709551616 (div .cse1 18446744073709551616)))))) (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse2 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse2)) (= .cse2 0))))) [2022-11-23 04:02:43,905 INFO L902 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7375 7381) the Hoare annotation is: true [2022-11-23 04:02:43,905 INFO L899 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2022-11-23 04:02:43,905 INFO L899 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2022-11-23 04:02:43,906 INFO L899 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2022-11-23 04:02:43,906 INFO L899 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2022-11-23 04:02:43,906 INFO L899 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2022-11-23 04:02:43,906 INFO L899 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2022-11-23 04:02:43,906 INFO L899 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2022-11-23 04:02:43,906 INFO L899 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2022-11-23 04:02:43,906 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7375 7381) no Hoare annotation was computed. [2022-11-23 04:02:43,907 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7375 7381) no Hoare annotation was computed. [2022-11-23 04:02:43,907 INFO L899 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2022-11-23 04:02:43,907 INFO L899 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2022-11-23 04:02:43,907 INFO L899 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2022-11-23 04:02:43,907 INFO L899 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2022-11-23 04:02:43,907 INFO L899 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2022-11-23 04:02:43,907 INFO L899 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2022-11-23 04:02:43,908 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-11-23 04:02:43,911 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-11-23 04:02:43,911 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-23 04:02:43,911 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-11-23 04:02:43,911 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayFINAL(lines 8203 8216) no Hoare annotation was computed. [2022-11-23 04:02:43,912 INFO L899 garLoopResultBuilder]: For program point L8204-1(line 8204) no Hoare annotation was computed. [2022-11-23 04:02:43,915 INFO L895 garLoopResultBuilder]: At program point L8204(line 8204) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (or (= 0 .cse0) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse0))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (not (let ((.cse1 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) (= |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|) (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|) (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|)) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14|) 0))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616))))))) [2022-11-23 04:02:43,917 INFO L895 garLoopResultBuilder]: At program point L8214(line 8214) the Hoare annotation is: (or (forall ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (or (= 0 .cse0) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse0))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (not (let ((.cse1 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (= |aws_byte_buf_from_array_#in~bytes.base| 0) (let ((.cse7 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse9 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse12 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8))) (let ((.cse10 (select .cse9 .cse12)) (.cse11 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse4 (select .cse7 .cse12))) (let ((.cse3 (= .cse4 0)) (.cse8 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse6 (select .cse11 |aws_byte_buf_from_array_~#buf~1.offset|)) (.cse2 (= .cse10 0)) (.cse5 (select .cse11 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16)))) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) (or .cse2 (< 0 (mod |aws_byte_buf_from_array_#in~len| 18446744073709551616))) (or .cse3 (= .cse4 |aws_byte_buf_from_array_#in~bytes.offset|)) (= .cse5 .cse6) (= (select .cse7 .cse8) 0) (or .cse3 (<= .cse6 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse6) 18446744073709551616))))) (= (select .cse9 .cse8) 0) (= |aws_byte_buf_from_array_~#buf~1.offset| 0) (not (= |aws_byte_buf_from_array_~#buf~1.base| 0)) (= |aws_byte_buf_from_array_#in~len| .cse6) (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|) (or .cse2 (= .cse10 |aws_byte_buf_from_array_#in~bytes.base|)) (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|) (or (not .cse2) (<= .cse5 (* 18446744073709551616 (div .cse5 18446744073709551616)))))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14| Int)) (not (let ((.cse13 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14|) 0))) (<= .cse13 (* 18446744073709551616 (div .cse13 18446744073709551616))))))) [2022-11-23 04:02:43,917 INFO L895 garLoopResultBuilder]: At program point aws_byte_buf_from_arrayENTRY(lines 8203 8216) 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|)) (forall ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (or (= 0 .cse0) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse0))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (not (let ((.cse1 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (= |aws_byte_buf_from_array_#in~bytes.base| 0) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14| Int)) (not (let ((.cse2 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14|) 0))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616))))))) [2022-11-23 04:02:43,917 INFO L899 garLoopResultBuilder]: For program point aws_byte_buf_from_arrayEXIT(lines 8203 8216) no Hoare annotation was computed. [2022-11-23 04:02:43,918 INFO L899 garLoopResultBuilder]: For program point L8214-2(line 8214) no Hoare annotation was computed. [2022-11-23 04:02:43,918 INFO L895 garLoopResultBuilder]: At program point L8214-1(line 8214) the Hoare annotation is: (let ((.cse18 (select |#memory_int| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse17 (select |#memory_$Pointer$.offset| |aws_byte_buf_from_array_~#buf~1.base|)) (.cse19 (+ |aws_byte_buf_from_array_~#buf~1.offset| 8))) (let ((.cse16 (+ |aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse3 (select .cse17 .cse19)) (.cse6 (select .cse18 |aws_byte_buf_from_array_~#buf~1.offset|)) (.cse15 (select |#memory_$Pointer$.base| |aws_byte_buf_from_array_~#buf~1.base|))) (let ((.cse9 (select .cse15 .cse19)) (.cse4 (= (select .cse18 (+ |aws_byte_buf_from_array_~#buf~1.offset| 16)) .cse6)) (.cse2 (= .cse3 0)) (.cse5 (= (select .cse17 .cse16) 0)) (.cse7 (= (select .cse15 .cse16) 0)) (.cse8 (= |aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse10 (not (= |aws_byte_buf_from_array_~#buf~1.base| 0))) (.cse11 (= |aws_byte_buf_from_array_#in~len| .cse6)) (.cse12 (= aws_byte_buf_from_array_~len |aws_byte_buf_from_array_#in~len|)) (.cse13 (= aws_byte_buf_from_array_~bytes.base |aws_byte_buf_from_array_#in~bytes.base|))) (or (forall ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse0 (select (select |old(#memory_$Pointer$.base)| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (or (= 0 .cse0) (not (= (select (select |old(#memory_$Pointer$.base)| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse0))))) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (not (let ((.cse1 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))))) (and (= aws_byte_buf_from_array_~bytes.offset |aws_byte_buf_from_array_#in~bytes.offset|) (or .cse2 (= .cse3 |aws_byte_buf_from_array_#in~bytes.offset|)) .cse4 .cse5 (not (= (mod .cse6 18446744073709551616) 0)) (<= |aws_byte_buf_from_array_#t~ret1045| 1) .cse7 (<= 1 |aws_byte_buf_from_array_#t~ret1045|) .cse8 (= .cse9 |aws_byte_buf_from_array_#in~bytes.base|) .cse10 .cse11 .cse12 .cse13) (= |aws_byte_buf_from_array_#in~bytes.base| 0) (and (= .cse9 0) (= |aws_byte_buf_from_array_#t~ret1045| 1) .cse4 .cse2 .cse5 .cse7 (<= 0 (+ |aws_byte_buf_from_array_#in~len| (* (div (- |aws_byte_buf_from_array_#in~len|) 18446744073709551616) 18446744073709551616))) .cse8 .cse10 .cse11 .cse12 .cse13) (forall ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14| Int)) (not (let ((.cse14 (select (select |old(#memory_int)| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_14|) 0))) (<= .cse14 (* 18446744073709551616 (div .cse14 18446744073709551616)))))))))) [2022-11-23 04:02:43,919 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-11-23 04:02:43,919 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-11-23 04:02:43,919 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-11-23 04:02:43,919 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 04:02:43,919 INFO L899 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2022-11-23 04:02:43,919 INFO L899 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2022-11-23 04:02:43,920 INFO L899 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2022-11-23 04:02:43,920 INFO L895 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0)) (.cse2 (select .cse25 .cse26)) (.cse1 (= (select .cse23 .cse26) 0))) (let ((.cse0 (and .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse2) .cse1))) (and (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or .cse0 (and .cse1 (= .cse2 0))) .cse3 (or .cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.offset| 0))) (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse17 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse5 (= (select .cse25 .cse24) 0)) (.cse6 (= (select .cse23 .cse24) 0)) (.cse7 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse22 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse19 (select .cse22 16)) (.cse20 (select .cse22 0))) (and (= .cse19 .cse20) (= .cse19 .cse17) (= .cse20 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse8 (= .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse11 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)))) (.cse14 (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse10 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse10 0)) (= .cse10 .cse2)))) .cse11 .cse12 .cse13 .cse14) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse18 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse16 (select .cse18 16)) (.cse15 (select .cse18 0))) (and (= .cse15 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse16 18446744073709551616) 0) (= .cse17 .cse16) (= (mod .cse15 18446744073709551616) 0))))) .cse11 .cse12 .cse13 .cse14))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))))) [2022-11-23 04:02:43,921 INFO L895 garLoopResultBuilder]: At program point L8971(lines 8971 8973) the Hoare annotation is: (let ((.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse1 (select .cse25 .cse26)) (.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= (select .cse23 .cse26) 0)) (.cse2 (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse17 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse4 (= (select .cse25 .cse24) 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1204#1.offset| 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1204#1.base| 0)) (.cse7 (= (select .cse23 .cse24) 0)) (.cse8 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse22 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse19 (select .cse22 16)) (.cse20 (select .cse22 0))) (and (= .cse19 .cse20) (= .cse19 .cse17) (= .cse20 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse9 (= .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse12 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse14 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616))))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse11 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse11 0)) (= .cse11 .cse1)))) .cse12 .cse13 .cse14) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse18 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse16 (select .cse18 16)) (.cse15 (select .cse18 0))) (and (= .cse15 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse16 18446744073709551616) 0) (= .cse17 .cse16) (= (mod .cse15 18446744073709551616) 0))))) .cse12 .cse13 .cse14))))))) (or (and .cse0 (= .cse1 0) .cse2) (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse1) .cse0 .cse2))))) [2022-11-23 04:02:43,921 INFO L899 garLoopResultBuilder]: For program point L8971-1(lines 8971 8973) no Hoare annotation was computed. [2022-11-23 04:02:43,921 INFO L895 garLoopResultBuilder]: At program point L8965(line 8965) the Hoare annotation is: (and (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse0 (+ 18446744073709551615 (* (div (+ (- 1) .cse0) 18446744073709551616) 18446744073709551616))))) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse1 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse1)))) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0)) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6|) 0))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616))))) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0) (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)))) [2022-11-23 04:02:43,921 INFO L899 garLoopResultBuilder]: For program point L8965-1(line 8965) no Hoare annotation was computed. [2022-11-23 04:02:43,922 INFO L895 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse24 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse25 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (select .cse24 .cse25)) (.cse22 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= (select .cse22 .cse25) 0)) (.cse1 (let ((.cse20 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse11 (select .cse20 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse23 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse4 (= (select .cse24 .cse23) 0)) (.cse5 (= (select .cse22 .cse23) 0)) (.cse6 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse21 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse18 (select .cse21 16)) (.cse19 (select .cse21 0))) (and (= .cse18 .cse19) (= .cse18 .cse11) (= .cse19 (select .cse20 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse7 (= .cse11 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse13 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1202#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse16 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616))))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse12 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse10 (select .cse12 16)) (.cse9 (select .cse12 0))) (and (= .cse9 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse10 18446744073709551616) 0) (= .cse11 .cse10) (= (mod .cse9 18446744073709551616) 0))))) .cse13 .cse14 .cse15 .cse16) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse17 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse17 0)) (= .cse17 .cse2)))) .cse13 .cse14 .cse15 .cse16))))))) (or (and .cse0 .cse1 (= .cse2 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse2) .cse0 .cse1))))) [2022-11-23 04:02:43,922 INFO L899 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2022-11-23 04:02:43,922 INFO L899 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2022-11-23 04:02:43,923 INFO L895 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0)) (.cse2 (select .cse25 .cse26)) (.cse1 (= (select .cse23 .cse26) 0))) (let ((.cse0 (and .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse2) .cse1))) (and (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or .cse0 (and .cse1 (= .cse2 0))) .cse3 (or .cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.offset| 0))) (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse17 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse5 (= (select .cse25 .cse24) 0)) (.cse6 (= (select .cse23 .cse24) 0)) (.cse7 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse22 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse19 (select .cse22 16)) (.cse20 (select .cse22 0))) (and (= .cse19 .cse20) (= .cse19 .cse17) (= .cse20 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse8 (= .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse11 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)))) (.cse14 (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse10 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse10 0)) (= .cse10 .cse2)))) .cse11 .cse12 .cse13 .cse14) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse18 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse16 (select .cse18 16)) (.cse15 (select .cse18 0))) (and (= .cse15 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse16 18446744073709551616) 0) (= .cse17 .cse16) (= (mod .cse15 18446744073709551616) 0))))) .cse11 .cse12 .cse13 .cse14))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))))) [2022-11-23 04:02:43,923 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-23 04:02:43,923 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 04:02:43,924 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-23 04:02:43,924 INFO L899 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2022-11-23 04:02:43,924 INFO L899 garLoopResultBuilder]: For program point L8959(lines 8959 8977) no Hoare annotation was computed. [2022-11-23 04:02:43,924 INFO L902 garLoopResultBuilder]: At program point L8978(line 8978) the Hoare annotation is: true [2022-11-23 04:02:43,925 INFO L899 garLoopResultBuilder]: For program point L8974-2(lines 8974 8976) no Hoare annotation was computed. [2022-11-23 04:02:43,925 INFO L895 garLoopResultBuilder]: At program point L8970(line 8970) the Hoare annotation is: (let ((.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse1 (select .cse25 .cse4)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse0 (let ((.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse13 (select .cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse5 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse6 (= (select .cse25 .cse24) 0)) (.cse7 (= (select .cse3 .cse24) 0)) (.cse8 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse23 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse20 (select .cse23 16)) (.cse21 (select .cse23 0))) (and (= .cse20 .cse21) (= .cse20 .cse13) (= .cse21 (select .cse22 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse9 (= .cse13 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse15 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1203#1| |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse18 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616))))) (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse14 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse12 (select .cse14 16)) (.cse11 (select .cse14 0))) (and (= .cse11 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse12 18446744073709551616) 0) (= .cse13 .cse12) (= (mod .cse11 18446744073709551616) 0))))) .cse15 .cse16 .cse17 .cse18) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse19 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse19 0)) (= .cse19 .cse1)))) .cse15 .cse16 .cse17 .cse18)))))) (.cse2 (= (select .cse3 .cse4) 0))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse1) .cse2) (and .cse0 .cse2 (= .cse1 0)))))) [2022-11-23 04:02:43,925 INFO L899 garLoopResultBuilder]: For program point L8974(lines 8974 8976) no Hoare annotation was computed. [2022-11-23 04:02:43,926 INFO L895 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0)) (.cse2 (select .cse25 .cse26)) (.cse1 (= (select .cse23 .cse26) 0))) (let ((.cse0 (and .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse2) .cse1))) (and (= |ULTIMATE.start_assert_bytes_match_#t~mem585#1| |ULTIMATE.start_assert_bytes_match_#t~mem584#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or .cse0 (and .cse1 (= .cse2 0))) .cse3 (or .cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.offset| 0))) (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse17 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse5 (= (select .cse25 .cse24) 0)) (.cse6 (= (select .cse23 .cse24) 0)) (.cse7 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse22 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse19 (select .cse22 16)) (.cse20 (select .cse22 0))) (and (= .cse19 .cse20) (= .cse19 .cse17) (= .cse20 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse8 (= .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse11 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)))) (.cse14 (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse10 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse10 0)) (= .cse10 .cse2)))) .cse11 .cse12 .cse13 .cse14) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse18 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse16 (select .cse18 16)) (.cse15 (select .cse18 0))) (and (= .cse15 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse16 18446744073709551616) 0) (= .cse17 .cse16) (= (mod .cse15 18446744073709551616) 0))))) .cse11 .cse12 .cse13 .cse14))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))))) [2022-11-23 04:02:43,926 INFO L895 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: (and (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_21|) 0))) (<= .cse0 (+ 18446744073709551615 (* (div (+ (- 1) .cse0) 18446744073709551616) 18446744073709551616))))) (exists ((|v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24| Int) (|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse1 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse1 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base_BEFORE_CALL_24|) 8) .cse1)))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_6|) 0))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616)))))) [2022-11-23 04:02:43,926 INFO L899 garLoopResultBuilder]: For program point L8970-1(line 8970) no Hoare annotation was computed. [2022-11-23 04:02:43,927 INFO L895 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0)) (.cse2 (select .cse25 .cse26)) (.cse1 (= (select .cse23 .cse26) 0))) (let ((.cse0 (and .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse2) .cse1))) (and (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (or .cse0 (and .cse1 (= .cse2 0))) .cse3 (or .cse0 (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.base| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~mem1205#1.offset| 0))) (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse17 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse4 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse5 (= (select .cse25 .cse24) 0)) (.cse6 (= (select .cse23 .cse24) 0)) (.cse7 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse22 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse19 (select .cse22 16)) (.cse20 (select .cse22 0))) (and (= .cse19 .cse20) (= .cse19 .cse17) (= .cse20 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse8 (= .cse17 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse11 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)))) (.cse14 (not (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0)))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse10 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse10 0)) (= .cse10 .cse2)))) .cse11 .cse12 .cse13 .cse14) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse18 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse16 (select .cse18 16)) (.cse15 (select .cse18 0))) (and (= .cse15 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse16 18446744073709551616) 0) (= .cse17 .cse16) (= (mod .cse15 18446744073709551616) 0))))) .cse11 .cse12 .cse13 .cse14))))) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))))) [2022-11-23 04:02:43,928 INFO L895 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse20 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse18 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8)) (.cse11 (select .cse20 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse19 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse17 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse21 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse0 (= (select .cse17 .cse21) 0)) (.cse1 (= (select .cse19 .cse21) 0)) (.cse5 (select .cse20 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|)) (.cse2 (= .cse11 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse4 (= (select .cse19 .cse18) 0)) (.cse7 (select .cse17 .cse18)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0))) (or (and (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) .cse6 (= .cse7 0) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_40| Int)) (let ((.cse8 (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_40|) 0))) (and (<= .cse8 (* 18446744073709551616 (div .cse8 18446744073709551616))) (= .cse5 .cse8))))) (and .cse0 .cse1 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse12 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse9 (select .cse12 16)) (.cse10 (select .cse12 0))) (and (= .cse9 .cse10) (= .cse9 .cse11) (= .cse10 .cse5))))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_65| Int)) (let ((.cse15 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_65|))) (let ((.cse14 (select .cse15 0)) (.cse13 (select .cse15 16))) (and (= .cse11 .cse13) (not (= (mod .cse14 18446744073709551616) 0)) (= .cse14 .cse13))))) .cse2 .cse3 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse7) .cse4 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse16 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse16 0)) (= .cse16 .cse7)))) .cse6 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616)))))))) [2022-11-23 04:02:43,929 INFO L895 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 8))) (let ((.cse2 (select .cse25 .cse26)) (.cse23 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse0 (= (select .cse23 .cse26) 0)) (.cse1 (let ((.cse21 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base|))) (let ((.cse12 (select .cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))) (.cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 24))) (let ((.cse3 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| 0))) (.cse4 (= (select .cse25 .cse24) 0)) (.cse5 (= (select .cse23 .cse24) 0)) (.cse6 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_77| Int)) (let ((.cse22 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_77|))) (let ((.cse19 (select .cse22 16)) (.cse20 (select .cse22 0))) (and (= .cse19 .cse20) (= .cse19 .cse12) (= .cse20 (select .cse21 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset|))))))) (.cse7 (= .cse12 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|)) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1201#1| 1)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.base| 0))) (.cse14 (or (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (and (not (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))) (= (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 8) 0))) (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30| Int)) (< 0 (mod (select (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_BEFORE_CALL_30|) 0) 18446744073709551616))))) (.cse15 (<= 1 |ULTIMATE.start_aws_byte_buf_from_array_harness_#t~ret1201#1|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3#1.offset| 0)) (.cse17 (<= |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| (+ 36028797018963967 (* (div |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1| 18446744073709551616) 18446744073709551616))))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_49| Int)) (let ((.cse13 (select |#memory_int| |v_aws_byte_buf_from_array_~#buf~1.base_49|))) (let ((.cse11 (select .cse13 16)) (.cse10 (select .cse13 0))) (and (= .cse10 |ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2#1|) (= (mod .cse11 18446744073709551616) 0) (= .cse12 .cse11) (= (mod .cse10 18446744073709551616) 0))))) .cse14 .cse15 .cse16 .cse17) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_aws_byte_buf_from_array_~#buf~1.base_78| Int)) (let ((.cse18 (select (select |#memory_$Pointer$.base| |v_aws_byte_buf_from_array_~#buf~1.base_78|) 8))) (and (not (= .cse18 0)) (= .cse18 .cse2)))) .cse14 .cse15 .cse16 .cse17))))))) (or (and .cse0 .cse1 (= .cse2 0)) (and (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0#1.base| .cse2) .cse0 .cse1))))) [2022-11-23 04:02:43,930 INFO L899 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2022-11-23 04:02:43,930 INFO L899 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2022-11-23 04:02:43,930 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-11-23 04:02:43,930 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-11-23 04:02:43,930 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-11-23 04:02:43,930 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-11-23 04:02:43,931 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-11-23 04:02:43,931 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-11-23 04:02:43,934 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, 1, 1, 1, 1, 1, 1] [2022-11-23 04:02:43,936 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 04:02:43,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:02:43 BoogieIcfgContainer [2022-11-23 04:02:43,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 04:02:43,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 04:02:43,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 04:02:43,948 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 04:02:43,948 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:58:31" (3/4) ... [2022-11-23 04:02:43,952 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 04:02:43,961 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-11-23 04:02:43,961 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_from_array [2022-11-23 04:02:43,961 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-11-23 04:02:43,961 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2022-11-23 04:02:43,962 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-23 04:02:43,962 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-23 04:02:43,973 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2022-11-23 04:02:43,974 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2022-11-23 04:02:43,975 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-11-23 04:02:43,976 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-23 04:02:43,977 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-23 04:02:43,978 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-23 04:02:43,978 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-23 04:02:43,979 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 04:02:44,913 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 04:02:44,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 04:02:44,922 INFO L158 Benchmark]: Toolchain (without parser) took 258431.77ms. Allocated memory was 148.9MB in the beginning and 931.1MB in the end (delta: 782.2MB). Free memory was 97.5MB in the beginning and 770.9MB in the end (delta: -673.4MB). Peak memory consumption was 597.5MB. Max. memory is 16.1GB. [2022-11-23 04:02:44,924 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 04:02:44,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2820.51ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 97.0MB in the beginning and 92.7MB in the end (delta: 4.3MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. [2022-11-23 04:02:44,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 225.02ms. Allocated memory is still 199.2MB. Free memory was 92.7MB in the beginning and 137.8MB in the end (delta: -45.0MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2022-11-23 04:02:44,926 INFO L158 Benchmark]: Boogie Preprocessor took 114.00ms. Allocated memory is still 199.2MB. Free memory was 137.8MB in the beginning and 131.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 04:02:44,926 INFO L158 Benchmark]: RCFGBuilder took 1719.39ms. Allocated memory is still 199.2MB. Free memory was 131.5MB in the beginning and 116.1MB in the end (delta: 15.4MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2022-11-23 04:02:44,926 INFO L158 Benchmark]: TraceAbstraction took 252576.28ms. Allocated memory was 199.2MB in the beginning and 931.1MB in the end (delta: 731.9MB). Free memory was 115.1MB in the beginning and 344.2MB in the end (delta: -229.1MB). Peak memory consumption was 537.4MB. Max. memory is 16.1GB. [2022-11-23 04:02:44,926 INFO L158 Benchmark]: Witness Printer took 965.77ms. Allocated memory is still 931.1MB. Free memory was 344.2MB in the beginning and 770.9MB in the end (delta: -426.8MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2022-11-23 04:02:44,927 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.23ms. Allocated memory is still 100.7MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2820.51ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 97.0MB in the beginning and 92.7MB in the end (delta: 4.3MB). Peak memory consumption was 77.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 225.02ms. Allocated memory is still 199.2MB. Free memory was 92.7MB in the beginning and 137.8MB in the end (delta: -45.0MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.00ms. Allocated memory is still 199.2MB. Free memory was 137.8MB in the beginning and 131.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1719.39ms. Allocated memory is still 199.2MB. Free memory was 131.5MB in the beginning and 116.1MB in the end (delta: 15.4MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. * TraceAbstraction took 252576.28ms. Allocated memory was 199.2MB in the beginning and 931.1MB in the end (delta: 731.9MB). Free memory was 115.1MB in the beginning and 344.2MB in the end (delta: -229.1MB). Peak memory consumption was 537.4MB. Max. memory is 16.1GB. * Witness Printer took 965.77ms. Allocated memory is still 931.1MB. Free memory was 344.2MB in the beginning and 770.9MB in the end (delta: -426.8MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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 7 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 252.5s, OverallIterations: 30, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 132.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 241 mSolverCounterUnknown, 5551 SdHoareTripleChecker+Valid, 93.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5375 mSDsluCounter, 7662 SdHoareTripleChecker+Invalid, 89.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6421 mSDsCounter, 1416 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31926 IncrementalHoareTripleChecker+Invalid, 33583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1416 mSolverCounterUnsat, 1241 mSDtfsCounter, 31926 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2626 GetRequests, 1590 SyntacticMatches, 61 SemanticMatches, 975 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10967 ImplicationChecksByTransitivity, 60.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=20, InterpolantAutomatonStates: 542, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 641 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 206 PreInvPairs, 225 NumberOfFragments, 5326 HoareAnnotationTreeSize, 206 FomulaSimplifications, 180 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 22 FomulaSimplificationsInter, 72867 FormulaSimplificationTreeSizeReductionInter, 10.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 11.4s SatisfiabilityAnalysisTime, 90.1s InterpolantComputationTime, 2734 NumberOfCodeBlocks, 2734 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3009 ConstructedInterpolants, 362 QuantifiedInterpolants, 28037 SizeOfPredicates, 198 NumberOfNonLiveVariables, 35142 ConjunctsInSsa, 638 ConjunctsInUnsatCore, 49 InterpolantComputations, 20 PerfectInterpolantSequences, 811/1120 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: 8978]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-23 04:02:45,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4d5e887-cfc0-4230-bc64-a09201635881/bin/uautomizer-QkZJyEgLgS/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