./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:34:14,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:34:14,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:34:14,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:34:14,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:34:14,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:34:14,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:34:14,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:34:14,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:34:14,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:34:14,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:34:14,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:34:14,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:34:14,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:34:14,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:34:14,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:34:14,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:34:14,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:34:14,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:34:14,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:34:14,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:34:14,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:34:14,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:34:14,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:34:14,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:34:14,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:34:14,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:34:14,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:34:14,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:34:14,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:34:14,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:34:14,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:34:14,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:34:14,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:34:14,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:34:14,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:34:14,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:34:14,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:34:14,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:34:14,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:34:14,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:34:14,480 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 11:34:14,533 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:34:14,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:34:14,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:34:14,534 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:34:14,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:34:14,536 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:34:14,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:34:14,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:34:14,537 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:34:14,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:34:14,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:34:14,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:34:14,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:34:14,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:34:14,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:34:14,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:34:14,541 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:34:14,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:34:14,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:34:14,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:34:14,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:34:14,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:34:14,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:34:14,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:34:14,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:34:14,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:34:14,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:34:14,544 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:34:14,544 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:34:14,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:34:14,545 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8feb785efb60d35f9204dc33a12e80ea59efcec5de2b7c2ff320ef29197b0bd [2022-11-16 11:34:14,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:34:14,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:34:14,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:34:14,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:34:14,899 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:34:14,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-11-16 11:34:14,960 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/data/c2425f588/9f7b99f3838c48a8971db17f0f6e5782/FLAGa322c9587 [2022-11-16 11:34:15,724 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:34:15,725 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i [2022-11-16 11:34:15,765 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/data/c2425f588/9f7b99f3838c48a8971db17f0f6e5782/FLAGa322c9587 [2022-11-16 11:34:15,797 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/data/c2425f588/9f7b99f3838c48a8971db17f0f6e5782 [2022-11-16 11:34:15,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:34:15,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:34:15,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:34:15,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:34:15,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:34:15,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:34:15" (1/1) ... [2022-11-16 11:34:15,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bcf87d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:15, skipping insertion in model container [2022-11-16 11:34:15,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:34:15" (1/1) ... [2022-11-16 11:34:15,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:34:15,951 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:34:16,310 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2022-11-16 11:34:16,317 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2022-11-16 11:34:17,349 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:17,350 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:17,350 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:17,351 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:17,352 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:17,367 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:17,367 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:17,369 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:17,370 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:17,834 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 11:34:17,847 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 11:34:17,848 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 11:34:17,852 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 11:34:17,854 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 11:34:17,859 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 11:34:17,860 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 11:34:17,860 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 11:34:17,861 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 11:34:17,862 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 11:34:18,038 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 11:34:18,156 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,157 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:34:18,303 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:34:18,317 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4499,4512] [2022-11-16 11:34:18,318 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/sv-benchmarks/c/aws-c-common/aws_string_new_from_c_str_harness.i[4559,4572] [2022-11-16 11:34:18,366 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,375 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,375 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,376 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,377 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,383 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,383 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,384 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,385 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,447 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-11-16 11:34:18,448 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-11-16 11:34:18,454 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-11-16 11:34:18,455 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-11-16 11:34:18,456 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-11-16 11:34:18,457 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-11-16 11:34:18,457 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-11-16 11:34:18,458 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-11-16 11:34:18,458 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-11-16 11:34:18,459 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-11-16 11:34:18,487 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-11-16 11:34:18,580 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,582 WARN L1554 CHandler]: Possible shadowing of function index [2022-11-16 11:34:18,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:34:18,894 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:34:18,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18 WrapperNode [2022-11-16 11:34:18,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:34:18,896 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:34:18,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:34:18,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:34:18,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18" (1/1) ... [2022-11-16 11:34:19,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18" (1/1) ... [2022-11-16 11:34:19,129 INFO L138 Inliner]: procedures = 690, calls = 2735, calls flagged for inlining = 62, calls inlined = 9, statements flattened = 812 [2022-11-16 11:34:19,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:34:19,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:34:19,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:34:19,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:34:19,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18" (1/1) ... [2022-11-16 11:34:19,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18" (1/1) ... [2022-11-16 11:34:19,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18" (1/1) ... [2022-11-16 11:34:19,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18" (1/1) ... [2022-11-16 11:34:19,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18" (1/1) ... [2022-11-16 11:34:19,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18" (1/1) ... [2022-11-16 11:34:19,220 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18" (1/1) ... [2022-11-16 11:34:19,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18" (1/1) ... [2022-11-16 11:34:19,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:34:19,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:34:19,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:34:19,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:34:19,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18" (1/1) ... [2022-11-16 11:34:19,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:34:19,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:34:19,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:34:19,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:34:19,322 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-11-16 11:34:19,323 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-11-16 11:34:19,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:34:19,323 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-11-16 11:34:19,324 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-11-16 11:34:19,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2022-11-16 11:34:19,324 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-11-16 11:34:19,324 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-11-16 11:34:19,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-16 11:34:19,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-16 11:34:19,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:34:19,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-16 11:34:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-16 11:34:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-11-16 11:34:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-11-16 11:34:19,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 11:34:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 11:34:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:34:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:34:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:34:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:34:19,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:34:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-11-16 11:34:19,330 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-11-16 11:34:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-16 11:34:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-16 11:34:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2022-11-16 11:34:19,331 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2022-11-16 11:34:19,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 11:34:19,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 11:34:19,333 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2022-11-16 11:34:19,333 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2022-11-16 11:34:19,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:34:19,333 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-11-16 11:34:19,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-11-16 11:34:19,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:34:19,334 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_new_from_array [2022-11-16 11:34:19,334 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_new_from_array [2022-11-16 11:34:19,334 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-11-16 11:34:19,334 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-11-16 11:34:19,334 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-11-16 11:34:19,334 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-11-16 11:34:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-11-16 11:34:19,335 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-11-16 11:34:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:34:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2022-11-16 11:34:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:34:19,665 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:34:19,668 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:34:19,862 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !true; [2022-11-16 11:34:21,173 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:34:21,181 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:34:21,181 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 11:34:21,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:34:21 BoogieIcfgContainer [2022-11-16 11:34:21,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:34:21,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:34:21,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:34:21,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:34:21,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:34:15" (1/3) ... [2022-11-16 11:34:21,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:34:21, skipping insertion in model container [2022-11-16 11:34:21,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:34:18" (2/3) ... [2022-11-16 11:34:21,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:34:21, skipping insertion in model container [2022-11-16 11:34:21,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:34:21" (3/3) ... [2022-11-16 11:34:21,194 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_new_from_c_str_harness.i [2022-11-16 11:34:21,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:34:21,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:34:21,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:34:21,304 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;@6257f01e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:34:21,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:34:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-11-16 11:34:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 11:34:21,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:21,323 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:21,326 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:34:21,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:21,334 INFO L85 PathProgramCache]: Analyzing trace with hash -555983859, now seen corresponding path program 1 times [2022-11-16 11:34:21,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:21,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537306678] [2022-11-16 11:34:21,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:34:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:34:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:34:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:34:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:34:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:34:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-16 11:34:22,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:22,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537306678] [2022-11-16 11:34:22,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537306678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:22,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:22,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:34:22,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459824719] [2022-11-16 11:34:22,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:22,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:34:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:22,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:34:22,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:34:22,334 INFO L87 Difference]: Start difference. First operand has 136 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 11:34:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:23,012 INFO L93 Difference]: Finished difference Result 283 states and 370 transitions. [2022-11-16 11:34:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:34:23,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2022-11-16 11:34:23,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:23,028 INFO L225 Difference]: With dead ends: 283 [2022-11-16 11:34:23,028 INFO L226 Difference]: Without dead ends: 147 [2022-11-16 11:34:23,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:34:23,046 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 102 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:23,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 146 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:34:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-16 11:34:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2022-11-16 11:34:23,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.15) internal successors, (92), 81 states have internal predecessors, (92), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-11-16 11:34:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-11-16 11:34:23,132 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 74 [2022-11-16 11:34:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:23,132 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-11-16 11:34:23,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 11:34:23,133 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-11-16 11:34:23,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 11:34:23,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:23,139 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:23,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:34:23,140 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:34:23,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1001240943, now seen corresponding path program 1 times [2022-11-16 11:34:23,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:23,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200786923] [2022-11-16 11:34:23,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:23,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:23,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:34:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:23,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:23,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:34:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:23,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:34:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:23,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:34:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:23,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:34:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:24,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:34:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:24,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:24,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-16 11:34:24,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:24,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200786923] [2022-11-16 11:34:24,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200786923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:24,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:24,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:34:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645630283] [2022-11-16 11:34:24,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:24,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:34:24,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:24,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:34:24,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:34:24,111 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-16 11:34:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:25,053 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2022-11-16 11:34:25,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:34:25,054 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), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2022-11-16 11:34:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:25,056 INFO L225 Difference]: With dead ends: 196 [2022-11-16 11:34:25,056 INFO L226 Difference]: Without dead ends: 152 [2022-11-16 11:34:25,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:34:25,057 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 104 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:25,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 330 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 11:34:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-16 11:34:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2022-11-16 11:34:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 85 states have internal predecessors, (96), 34 states have call successors, (34), 15 states have call predecessors, (34), 16 states have return successors, (34), 34 states have call predecessors, (34), 33 states have call successors, (34) [2022-11-16 11:34:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2022-11-16 11:34:25,073 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 74 [2022-11-16 11:34:25,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:25,074 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2022-11-16 11:34:25,074 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), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-16 11:34:25,074 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2022-11-16 11:34:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-16 11:34:25,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:25,076 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:25,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:34:25,076 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:34:25,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:25,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1994019405, now seen corresponding path program 1 times [2022-11-16 11:34:25,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:25,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469407480] [2022-11-16 11:34:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:25,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:34:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:34:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:34:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:34:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:34:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:34:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:34:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-16 11:34:25,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:25,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469407480] [2022-11-16 11:34:25,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469407480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:25,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:25,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 11:34:25,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455024315] [2022-11-16 11:34:25,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:25,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:34:25,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:25,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:34:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:34:25,890 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-16 11:34:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:27,017 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2022-11-16 11:34:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:34:27,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 80 [2022-11-16 11:34:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:27,020 INFO L225 Difference]: With dead ends: 217 [2022-11-16 11:34:27,020 INFO L226 Difference]: Without dead ends: 178 [2022-11-16 11:34:27,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:34:27,021 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 188 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:27,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 415 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-16 11:34:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-16 11:34:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 140. [2022-11-16 11:34:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 89 states have internal predecessors, (100), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 35 states have call predecessors, (35), 33 states have call successors, (35) [2022-11-16 11:34:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2022-11-16 11:34:27,041 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 80 [2022-11-16 11:34:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:27,042 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2022-11-16 11:34:27,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-16 11:34:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2022-11-16 11:34:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-16 11:34:27,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:27,044 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:27,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:34:27,045 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:34:27,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:27,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1920697878, now seen corresponding path program 1 times [2022-11-16 11:34:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:27,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376936549] [2022-11-16 11:34:27,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:34:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:34:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:34:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:34:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 11:34:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:34:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:34:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-16 11:34:28,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:28,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376936549] [2022-11-16 11:34:28,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376936549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:28,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:28,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 11:34:28,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232156460] [2022-11-16 11:34:28,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:28,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:34:28,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:28,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:34:28,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:34:28,445 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-16 11:34:30,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:30,185 INFO L93 Difference]: Finished difference Result 178 states and 219 transitions. [2022-11-16 11:34:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:34:30,192 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 82 [2022-11-16 11:34:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:30,193 INFO L225 Difference]: With dead ends: 178 [2022-11-16 11:34:30,194 INFO L226 Difference]: Without dead ends: 161 [2022-11-16 11:34:30,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-11-16 11:34:30,195 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 193 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:30,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 691 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-16 11:34:30,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-16 11:34:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2022-11-16 11:34:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 78 states have internal predecessors, (86), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-16 11:34:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 151 transitions. [2022-11-16 11:34:30,223 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 151 transitions. Word has length 82 [2022-11-16 11:34:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:30,226 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 151 transitions. [2022-11-16 11:34:30,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-16 11:34:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 151 transitions. [2022-11-16 11:34:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-16 11:34:30,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:30,235 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:30,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:34:30,236 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:34:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:30,236 INFO L85 PathProgramCache]: Analyzing trace with hash -870191708, now seen corresponding path program 1 times [2022-11-16 11:34:30,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:30,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496591233] [2022-11-16 11:34:30,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:30,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:30,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:30,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:34:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:30,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:30,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:30,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:34:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:30,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:34:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:30,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:34:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:30,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:34:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:30,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:34:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:30,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:34:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:30,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:34:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:34:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:34:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:34:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-16 11:34:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-16 11:34:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-16 11:34:31,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:31,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496591233] [2022-11-16 11:34:31,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496591233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:31,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:31,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:34:31,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668730103] [2022-11-16 11:34:31,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:31,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:34:31,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:31,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:34:31,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:34:31,314 INFO L87 Difference]: Start difference. First operand 126 states and 151 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-16 11:34:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:32,591 INFO L93 Difference]: Finished difference Result 206 states and 249 transitions. [2022-11-16 11:34:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:34:32,595 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2022-11-16 11:34:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:32,597 INFO L225 Difference]: With dead ends: 206 [2022-11-16 11:34:32,597 INFO L226 Difference]: Without dead ends: 151 [2022-11-16 11:34:32,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:34:32,599 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 171 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:32,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 412 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 11:34:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-16 11:34:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-11-16 11:34:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 82 states have internal predecessors, (90), 33 states have call successors, (33), 15 states have call predecessors, (33), 16 states have return successors, (33), 33 states have call predecessors, (33), 32 states have call successors, (33) [2022-11-16 11:34:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2022-11-16 11:34:32,615 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 123 [2022-11-16 11:34:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:32,616 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2022-11-16 11:34:32,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-16 11:34:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2022-11-16 11:34:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-16 11:34:32,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:32,619 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:32,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:34:32,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:34:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1724885987, now seen corresponding path program 1 times [2022-11-16 11:34:32,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:32,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570007253] [2022-11-16 11:34:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:32,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:34:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:34:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:34:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:34:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:34:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:34:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:34:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:34:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:34:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:34:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:34:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-16 11:34:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-16 11:34:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 11:34:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-16 11:34:33,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:33,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570007253] [2022-11-16 11:34:33,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570007253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:33,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:33,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 11:34:33,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686686648] [2022-11-16 11:34:33,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:33,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:34:33,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:33,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:34:33,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:34:33,829 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-16 11:34:35,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:35,162 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2022-11-16 11:34:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 11:34:35,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 129 [2022-11-16 11:34:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:35,165 INFO L225 Difference]: With dead ends: 212 [2022-11-16 11:34:35,165 INFO L226 Difference]: Without dead ends: 143 [2022-11-16 11:34:35,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:34:35,166 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 291 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:35,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 409 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 11:34:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-16 11:34:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 124. [2022-11-16 11:34:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 77 states have internal predecessors, (83), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-16 11:34:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 146 transitions. [2022-11-16 11:34:35,187 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 146 transitions. Word has length 129 [2022-11-16 11:34:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:35,190 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 146 transitions. [2022-11-16 11:34:35,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (23), 7 states have call predecessors, (23), 2 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) [2022-11-16 11:34:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 146 transitions. [2022-11-16 11:34:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-16 11:34:35,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:35,192 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:35,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:34:35,193 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:34:35,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:35,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1745997560, now seen corresponding path program 1 times [2022-11-16 11:34:35,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:35,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974297170] [2022-11-16 11:34:35,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:35,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:37,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:37,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:34:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:37,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:37,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:37,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:34:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:37,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:34:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:37,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:34:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:37,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:34:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:37,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:34:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:38,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:34:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:38,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:38,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:34:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:38,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:38,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:38,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:34:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:38,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:34:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:38,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:34:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:38,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:38,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:34:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:39,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:34:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:39,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-16 11:34:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-16 11:34:39,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:39,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974297170] [2022-11-16 11:34:39,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974297170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:39,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:39,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-16 11:34:39,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007850979] [2022-11-16 11:34:39,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:39,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 11:34:39,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:39,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 11:34:39,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2022-11-16 11:34:39,200 INFO L87 Difference]: Start difference. First operand 124 states and 146 transitions. Second operand has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-11-16 11:34:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:42,378 INFO L93 Difference]: Finished difference Result 190 states and 229 transitions. [2022-11-16 11:34:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 11:34:42,379 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) Word has length 134 [2022-11-16 11:34:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:42,380 INFO L225 Difference]: With dead ends: 190 [2022-11-16 11:34:42,380 INFO L226 Difference]: Without dead ends: 143 [2022-11-16 11:34:42,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=1388, Unknown=0, NotChecked=0, Total=1560 [2022-11-16 11:34:42,382 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 94 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 1885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:42,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1034 Invalid, 1885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-16 11:34:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-16 11:34:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2022-11-16 11:34:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 88 states have internal predecessors, (93), 34 states have call successors, (34), 15 states have call predecessors, (34), 17 states have return successors, (35), 33 states have call predecessors, (35), 33 states have call successors, (35) [2022-11-16 11:34:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 162 transitions. [2022-11-16 11:34:42,406 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 162 transitions. Word has length 134 [2022-11-16 11:34:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:42,406 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 162 transitions. [2022-11-16 11:34:42,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.25) internal successors, (65), 17 states have internal predecessors, (65), 8 states have call successors, (24), 6 states have call predecessors, (24), 7 states have return successors, (22), 10 states have call predecessors, (22), 8 states have call successors, (22) [2022-11-16 11:34:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 162 transitions. [2022-11-16 11:34:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-16 11:34:42,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:42,410 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:42,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:34:42,411 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:34:42,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:42,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1524709556, now seen corresponding path program 1 times [2022-11-16 11:34:42,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:42,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051593794] [2022-11-16 11:34:42,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:42,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:34:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:34:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:34:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:34:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:34:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:34:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:34:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:34:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:42,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 11:34:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:43,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:43,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:43,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:34:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:34:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:43,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:34:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:43,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:34:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:43,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:43,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-16 11:34:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:43,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-16 11:34:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-16 11:34:43,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:43,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051593794] [2022-11-16 11:34:43,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051593794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:43,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:43,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 11:34:43,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907039298] [2022-11-16 11:34:43,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:43,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:34:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:43,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:34:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:34:43,157 INFO L87 Difference]: Start difference. First operand 137 states and 162 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-16 11:34:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:44,469 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2022-11-16 11:34:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:34:44,469 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2022-11-16 11:34:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:44,470 INFO L225 Difference]: With dead ends: 225 [2022-11-16 11:34:44,471 INFO L226 Difference]: Without dead ends: 119 [2022-11-16 11:34:44,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:34:44,472 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 103 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:44,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 425 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-16 11:34:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-16 11:34:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-16 11:34:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.082191780821918) internal successors, (79), 74 states have internal predecessors, (79), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-16 11:34:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2022-11-16 11:34:44,484 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 140 [2022-11-16 11:34:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:44,485 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2022-11-16 11:34:44,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (24), 7 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-16 11:34:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-11-16 11:34:44,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-16 11:34:44,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:44,487 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:44,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:34:44,488 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:34:44,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:44,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1517224244, now seen corresponding path program 1 times [2022-11-16 11:34:44,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:44,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098859879] [2022-11-16 11:34:44,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:44,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:34:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:34:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:34:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:34:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:34:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:34:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:34:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:34:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:34:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:34:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:34:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:34:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:34:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-16 11:34:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-16 11:34:45,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:45,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098859879] [2022-11-16 11:34:45,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098859879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:34:45,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:34:45,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:34:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161167422] [2022-11-16 11:34:45,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:34:45,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:34:45,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:45,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:34:45,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:34:45,432 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-16 11:34:46,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:34:46,314 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-11-16 11:34:46,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:34:46,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2022-11-16 11:34:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:34:46,316 INFO L225 Difference]: With dead ends: 166 [2022-11-16 11:34:46,316 INFO L226 Difference]: Without dead ends: 120 [2022-11-16 11:34:46,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:34:46,317 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 124 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:34:46,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 249 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 11:34:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-16 11:34:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-16 11:34:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 75 states have internal predecessors, (80), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-16 11:34:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2022-11-16 11:34:46,330 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 135 [2022-11-16 11:34:46,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:34:46,331 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2022-11-16 11:34:46,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (23), 6 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-16 11:34:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2022-11-16 11:34:46,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-16 11:34:46,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:34:46,333 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:34:46,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:34:46,333 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:34:46,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:34:46,334 INFO L85 PathProgramCache]: Analyzing trace with hash -473758278, now seen corresponding path program 1 times [2022-11-16 11:34:46,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:34:46,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484256001] [2022-11-16 11:34:46,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:46,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:34:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:34:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:34:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:34:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:34:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:34:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:34:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:34:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:34:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:34:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:34:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:34:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:34:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:34:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:50,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:50,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:34:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:50,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:34:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:50,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:34:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:50,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 11:34:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-16 11:34:50,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:34:50,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484256001] [2022-11-16 11:34:50,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484256001] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:34:50,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316327603] [2022-11-16 11:34:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:34:50,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:34:50,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:34:50,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:34:50,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:34:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:34:51,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 2934 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-16 11:34:51,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:34:52,468 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 13 treesize of output 9 [2022-11-16 11:34:54,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:34:54,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:34:54,474 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-16 11:34:54,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 33 [2022-11-16 11:34:54,592 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 11:34:54,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-16 11:34:55,830 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-16 11:34:55,831 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-16 11:34:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-16 11:34:56,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:34:58,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316327603] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:34:58,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:34:58,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 37] total 57 [2022-11-16 11:34:58,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275902406] [2022-11-16 11:34:58,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:34:58,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-16 11:34:58,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:34:58,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-16 11:34:58,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=4118, Unknown=2, NotChecked=0, Total=4290 [2022-11-16 11:34:58,985 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-16 11:35:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:05,939 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-11-16 11:35:05,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 11:35:05,940 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) Word has length 136 [2022-11-16 11:35:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:05,941 INFO L225 Difference]: With dead ends: 174 [2022-11-16 11:35:05,941 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 11:35:05,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1698 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=465, Invalid=9039, Unknown=2, NotChecked=0, Total=9506 [2022-11-16 11:35:05,951 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 253 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 4178 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 4613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 4178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:05,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1375 Invalid, 4613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 4178 Invalid, 0 Unknown, 220 Unchecked, 4.7s Time] [2022-11-16 11:35:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 11:35:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-11-16 11:35:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 75 states have (on average 1.08) internal successors, (81), 76 states have internal predecessors, (81), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-16 11:35:05,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2022-11-16 11:35:05,972 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 136 [2022-11-16 11:35:05,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:05,973 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2022-11-16 11:35:05,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 50 states have (on average 2.48) internal successors, (124), 42 states have internal predecessors, (124), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-16 11:35:05,974 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2022-11-16 11:35:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-16 11:35:05,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:05,976 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:05,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:06,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:06,187 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:35:06,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:06,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1103785842, now seen corresponding path program 2 times [2022-11-16 11:35:06,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:06,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112404550] [2022-11-16 11:35:06,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:06,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:35:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:35:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:35:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:35:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:35:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:35:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:35:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:35:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:35:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:35:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:35:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:35:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:09,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:35:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:35:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-16 11:35:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-16 11:35:10,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:10,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112404550] [2022-11-16 11:35:10,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112404550] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:10,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048185593] [2022-11-16 11:35:10,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:35:10,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:10,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:10,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:10,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:35:13,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:35:13,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:35:13,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 3065 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-16 11:35:13,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:13,863 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 13 treesize of output 9 [2022-11-16 11:35:14,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:14,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:14,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-16 11:35:14,547 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 11:35:14,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-11-16 11:35:15,676 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-16 11:35:15,676 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 61 [2022-11-16 11:35:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:35:15,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:18,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048185593] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:18,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:35:18,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 49 [2022-11-16 11:35:18,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103791312] [2022-11-16 11:35:18,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:18,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-16 11:35:18,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:18,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-16 11:35:18,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=3160, Unknown=2, NotChecked=0, Total=3306 [2022-11-16 11:35:18,418 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 49 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 36 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 11:35:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:23,869 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2022-11-16 11:35:23,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 11:35:23,870 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 36 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 137 [2022-11-16 11:35:23,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:23,872 INFO L225 Difference]: With dead ends: 173 [2022-11-16 11:35:23,872 INFO L226 Difference]: Without dead ends: 122 [2022-11-16 11:35:23,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=330, Invalid=6640, Unknown=2, NotChecked=0, Total=6972 [2022-11-16 11:35:23,875 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 120 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 3736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 764 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:23,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1589 Invalid, 3736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2880 Invalid, 0 Unknown, 764 Unchecked, 3.6s Time] [2022-11-16 11:35:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-16 11:35:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-16 11:35:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 77 states have internal predecessors, (82), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-16 11:35:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2022-11-16 11:35:23,889 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 137 [2022-11-16 11:35:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:23,890 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2022-11-16 11:35:23,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 36 states have internal predecessors, (107), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 11:35:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2022-11-16 11:35:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-16 11:35:23,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:23,892 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:23,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 11:35:24,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 11:35:24,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:35:24,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash 840196154, now seen corresponding path program 3 times [2022-11-16 11:35:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:24,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910330891] [2022-11-16 11:35:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:35:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:35:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:35:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:35:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:35:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:35:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:35:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:35:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:35:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:35:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:35:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:35:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:35:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:27,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:35:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:28,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 11:35:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-16 11:35:28,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:28,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910330891] [2022-11-16 11:35:28,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910330891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:28,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715675108] [2022-11-16 11:35:28,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:35:28,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:28,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:28,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:28,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:35:32,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 11:35:32,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:35:32,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-16 11:35:32,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:32,989 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 13 treesize of output 9 [2022-11-16 11:35:33,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:33,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:33,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:33,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2022-11-16 11:35:33,906 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 11:35:33,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-16 11:35:34,950 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-16 11:35:34,950 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-16 11:35:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-16 11:35:35,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:35:37,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715675108] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:37,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:35:37,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 51 [2022-11-16 11:35:37,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225984169] [2022-11-16 11:35:37,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:35:37,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-16 11:35:37,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:37,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-16 11:35:37,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=3389, Unknown=2, NotChecked=0, Total=3540 [2022-11-16 11:35:37,988 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 51 states, 46 states have (on average 2.369565217391304) internal successors, (109), 38 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 11:35:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:35:43,756 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2022-11-16 11:35:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 11:35:43,758 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 46 states have (on average 2.369565217391304) internal successors, (109), 38 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 138 [2022-11-16 11:35:43,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:35:43,759 INFO L225 Difference]: With dead ends: 174 [2022-11-16 11:35:43,759 INFO L226 Difference]: Without dead ends: 123 [2022-11-16 11:35:43,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=335, Invalid=6973, Unknown=2, NotChecked=0, Total=7310 [2022-11-16 11:35:43,762 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 151 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 3130 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 650 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:35:43,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1659 Invalid, 3909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3130 Invalid, 0 Unknown, 650 Unchecked, 3.7s Time] [2022-11-16 11:35:43,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-16 11:35:43,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-11-16 11:35:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 77 states have (on average 1.077922077922078) internal successors, (83), 78 states have internal predecessors, (83), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-16 11:35:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2022-11-16 11:35:43,779 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 138 [2022-11-16 11:35:43,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:35:43,780 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2022-11-16 11:35:43,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 46 states have (on average 2.369565217391304) internal successors, (109), 38 states have internal predecessors, (109), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 11:35:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2022-11-16 11:35:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-16 11:35:43,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:35:43,783 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:35:43,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:35:43,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:43,997 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:35:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:43,998 INFO L85 PathProgramCache]: Analyzing trace with hash 974095886, now seen corresponding path program 4 times [2022-11-16 11:35:43,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:43,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454569724] [2022-11-16 11:35:43,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:43,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:35:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:35:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:35:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:35:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:35:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:35:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:35:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:35:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:35:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:35:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:35:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:35:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:35:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:35:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:47,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:35:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:48,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:35:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:48,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-16 11:35:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-16 11:35:48,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:48,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454569724] [2022-11-16 11:35:48,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454569724] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:35:48,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112669453] [2022-11-16 11:35:48,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:35:48,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:35:48,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:48,786 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:35:48,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:35:51,641 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:35:51,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:35:51,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 3327 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-16 11:35:51,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:35:52,523 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 13 treesize of output 9 [2022-11-16 11:35:52,807 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2807 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_27| Int) (v_ArrVal_2811 Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_2807) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_27| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2811)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_27| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1315_27|))) (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616))) is different from true [2022-11-16 11:35:52,837 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_27| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_28| Int) (v_ArrVal_2811 Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_2807) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_27| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2811) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_28| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2818)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_27| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_28|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_28| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1315_27|)))) is different from true [2022-11-16 11:35:52,865 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_2807 Int) (v_ArrVal_2818 Int) (v_ArrVal_2819 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_27| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_29| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_28| Int) (v_ArrVal_2811 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_28| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_29|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_2807) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_27| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2811) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_28| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2818) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_29| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_2819))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_27| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_28|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1315_27|)))) is different from true [2022-11-16 11:35:53,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:53,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:53,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:53,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:53,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:53,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:53,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:53,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:53,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:53,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:35:53,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 47 [2022-11-16 11:35:53,717 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 11:35:53,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-16 11:35:54,924 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-16 11:35:54,925 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-16 11:35:55,152 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 57 trivial. 9 not checked. [2022-11-16 11:35:55,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:36:00,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112669453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:36:00,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:36:00,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 41] total 64 [2022-11-16 11:36:00,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130255759] [2022-11-16 11:36:00,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:36:00,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-16 11:36:00,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:00,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-16 11:36:00,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=4659, Unknown=4, NotChecked=414, Total=5256 [2022-11-16 11:36:00,303 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 64 states, 57 states have (on average 2.280701754385965) internal successors, (130), 49 states have internal predecessors, (130), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-16 11:36:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:15,634 INFO L93 Difference]: Finished difference Result 178 states and 211 transitions. [2022-11-16 11:36:15,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 11:36:15,635 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 57 states have (on average 2.280701754385965) internal successors, (130), 49 states have internal predecessors, (130), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) Word has length 139 [2022-11-16 11:36:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:15,636 INFO L225 Difference]: With dead ends: 178 [2022-11-16 11:36:15,636 INFO L226 Difference]: Without dead ends: 127 [2022-11-16 11:36:15,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1874 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=497, Invalid=11063, Unknown=8, NotChecked=642, Total=12210 [2022-11-16 11:36:15,642 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 242 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 4601 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 6041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 4601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1228 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:15,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1606 Invalid, 6041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 4601 Invalid, 0 Unknown, 1228 Unchecked, 5.5s Time] [2022-11-16 11:36:15,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-16 11:36:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-11-16 11:36:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 79 states have internal predecessors, (84), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-16 11:36:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2022-11-16 11:36:15,671 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 139 [2022-11-16 11:36:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:15,671 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2022-11-16 11:36:15,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 57 states have (on average 2.280701754385965) internal successors, (130), 49 states have internal predecessors, (130), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-16 11:36:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2022-11-16 11:36:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-16 11:36:15,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:15,676 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:15,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:36:15,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 11:36:15,900 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:36:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash 830020282, now seen corresponding path program 5 times [2022-11-16 11:36:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:15,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455277100] [2022-11-16 11:36:15,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:15,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:18,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:36:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:36:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:18,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:36:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:18,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:36:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:18,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:36:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:18,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:36:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:18,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:36:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:18,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:36:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:18,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:36:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:18,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:36:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:18,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:36:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:19,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:36:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:19,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:36:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:19,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:36:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:19,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:36:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:19,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:36:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:19,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:36:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:19,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:36:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:19,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:36:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:19,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:36:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:19,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:36:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:20,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-16 11:36:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 16 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-16 11:36:20,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:20,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455277100] [2022-11-16 11:36:20,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455277100] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:36:20,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367516659] [2022-11-16 11:36:20,529 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:36:20,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:20,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:36:20,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:36:20,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:37:00,603 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-11-16 11:37:00,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:37:00,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 3458 conjuncts, 161 conjunts are in the unsatisfiable core [2022-11-16 11:37:00,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:02,048 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 13 treesize of output 9 [2022-11-16 11:37:02,415 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_3848 Int) (v_ArrVal_3853 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_44| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_3848) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_44| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3853)) |c_#memory_int|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1315_44|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_44| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|)))) is different from true [2022-11-16 11:37:02,439 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_3848 Int) (v_ArrVal_3857 Int) (v_ArrVal_3853 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_45| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_44| Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1315_44|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_44| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_45|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_3848) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_44| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3853) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_45| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3857)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_45| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|)))) is different from true [2022-11-16 11:37:02,476 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_3848 Int) (v_ArrVal_3859 Int) (v_ArrVal_3857 Int) (v_ArrVal_3853 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_45| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_44| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_46| Int)) (and (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1315_44|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_46| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_44| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_45|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_45| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_46|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_3848) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_44| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3853) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_45| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3857) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_46| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3859)) |c_#memory_int|)))) is different from true [2022-11-16 11:37:02,527 WARN L855 $PredicateComparison]: unable to prove that (and (< 0 (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (exists ((v_ArrVal_3848 Int) (v_ArrVal_3859 Int) (v_ArrVal_3857 Int) (v_ArrVal_3863 Int) (v_ArrVal_3853 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_45| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_44| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_47| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_46| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_46| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_47|) (<= 1 |v_#Ultimate.C_memcpy_#t~loopctr1315_44|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_44| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_45|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) |c_#Ultimate.C_memcpy_dest.offset| v_ArrVal_3848) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_44| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3853) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_45| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3857) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_46| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3859) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_47| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_3863))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_45| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_46|)))) is different from true [2022-11-16 11:37:03,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:37:03,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 62 [2022-11-16 11:37:03,718 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 11:37:03,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-16 11:37:05,084 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-16 11:37:05,084 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-16 11:37:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 126 trivial. 14 not checked. [2022-11-16 11:37:05,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:37:11,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367516659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:11,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:37:11,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 44] total 70 [2022-11-16 11:37:11,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458778465] [2022-11-16 11:37:11,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:37:11,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-16 11:37:11,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:11,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-16 11:37:11,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=5367, Unknown=9, NotChecked=596, Total=6162 [2022-11-16 11:37:11,175 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 70 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 53 states have internal predecessors, (123), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-11-16 11:37:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:25,764 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2022-11-16 11:37:25,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-16 11:37:25,765 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 53 states have internal predecessors, (123), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) Word has length 140 [2022-11-16 11:37:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:25,767 INFO L225 Difference]: With dead ends: 178 [2022-11-16 11:37:25,767 INFO L226 Difference]: Without dead ends: 130 [2022-11-16 11:37:25,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2103 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=512, Invalid=12832, Unknown=12, NotChecked=924, Total=14280 [2022-11-16 11:37:25,771 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 144 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 4502 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 5865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 4502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1249 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:25,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1770 Invalid, 5865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 4502 Invalid, 0 Unknown, 1249 Unchecked, 5.6s Time] [2022-11-16 11:37:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-16 11:37:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-11-16 11:37:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 82 states have internal predecessors, (88), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-16 11:37:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 149 transitions. [2022-11-16 11:37:25,792 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 149 transitions. Word has length 140 [2022-11-16 11:37:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:25,792 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 149 transitions. [2022-11-16 11:37:25,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 53 states have internal predecessors, (123), 17 states have call successors, (42), 10 states have call predecessors, (42), 15 states have return successors, (38), 21 states have call predecessors, (38), 16 states have call successors, (38) [2022-11-16 11:37:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 149 transitions. [2022-11-16 11:37:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-16 11:37:25,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:25,795 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:25,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:37:26,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:37:26,011 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:37:26,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 658643854, now seen corresponding path program 6 times [2022-11-16 11:37:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:26,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443151258] [2022-11-16 11:37:26,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:26,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:37:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:37:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:37:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:37:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:37:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:37:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:37:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:37:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:37:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:37:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:37:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:37:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:37:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:37:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:37:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:37:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:37:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:37:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:37:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:37:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:37:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-16 11:37:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 28 proven. 22 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-16 11:37:31,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:31,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443151258] [2022-11-16 11:37:31,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443151258] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:37:31,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80806590] [2022-11-16 11:37:31,842 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 11:37:31,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:37:31,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:31,843 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:37:31,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:38:16,663 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-16 11:38:16,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:38:16,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 3563 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-16 11:38:16,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:38:17,132 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 13 treesize of output 9 [2022-11-16 11:38:17,344 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5073 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| 18446744073709551616))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |c_#Ultimate.C_memcpy_dest.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|) v_ArrVal_5073)))))) is different from true [2022-11-16 11:38:17,383 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5073 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_65| Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| Int) (v_ArrVal_5077 Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| 18446744073709551616))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |c_#Ultimate.C_memcpy_dest.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|) v_ArrVal_5073) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_65| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5077)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_65| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_65|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|))))) is different from true [2022-11-16 11:38:17,436 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5073 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_65| Int) (v_ArrVal_5080 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_66| Int) (v_ArrVal_5077 Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| 18446744073709551616))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |c_#Ultimate.C_memcpy_dest.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|) v_ArrVal_5073) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_65| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5077) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_66| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5080)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_66| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_65| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_66|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_65|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|))))) is different from true [2022-11-16 11:38:17,507 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5073 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_65| Int) (v_ArrVal_5084 Int) (v_ArrVal_5080 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_66| Int) (v_ArrVal_5077 Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| 18446744073709551616))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_65| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_66|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_67| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |c_#Ultimate.C_memcpy_dest.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|) v_ArrVal_5073) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_65| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5077) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_66| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5080) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5084)) |c_#memory_int|) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_65|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_66| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_67|)))) is different from true [2022-11-16 11:38:17,588 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5073 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_65| Int) (v_ArrVal_5084 Int) (v_ArrVal_5080 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_66| Int) (v_ArrVal_5077 Int) (v_ArrVal_5088 Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| 18446744073709551616))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_65| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_66|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |c_#Ultimate.C_memcpy_dest.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|) v_ArrVal_5073) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_65| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5077) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_66| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5080) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5084) (+ (- 1) |c_#Ultimate.C_memcpy_dest.offset| |c_#Ultimate.C_memcpy_#t~loopctr1315|) v_ArrVal_5088)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_67| 2) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_65|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_66| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_67|)))) is different from true [2022-11-16 11:38:17,710 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1315_67| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_66| Int) (v_ArrVal_5077 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_69| Int) (v_ArrVal_5088 Int) (v_ArrVal_5073 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_65| Int) (v_ArrVal_5084 Int) (v_ArrVal_5093 Int) (v_ArrVal_5080 Int) (|aux_div_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| Int) (|aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| Int)) (let ((.cse0 (* |aux_div_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| 18446744073709551616))) (and (<= 0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_67| 2) |v_#Ultimate.C_memcpy_#t~loopctr1315_69|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_65| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_66|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ .cse0 |c_#Ultimate.C_memcpy_dest.offset| |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|) v_ArrVal_5073) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_65| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5077) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_66| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5080) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_67| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5084) (+ (- 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_69| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5088) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_69| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_5093)) |c_#memory_int|) (< |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| (mod |c_#Ultimate.C_memcpy_size| 18446744073709551616)) (<= (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_65|) (<= 0 (+ .cse0 |aux_mod_v_#Ultimate.C_memcpy_#t~loopctr1315_64_67|)) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_66| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_67|)))) is different from true [2022-11-16 11:38:19,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:38:19,186 INFO L321 Elim1Store]: treesize reduction 22, result has 47.6 percent of original size [2022-11-16 11:38:19,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 27 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 86 [2022-11-16 11:38:19,336 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 11:38:19,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-16 11:38:20,608 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-16 11:38:20,608 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-16 11:38:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 150 trivial. 21 not checked. [2022-11-16 11:38:20,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:38:37,617 WARN L233 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 124 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:38:37,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80806590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:37,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:38:37,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32] total 60 [2022-11-16 11:38:37,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064650373] [2022-11-16 11:38:37,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:38:37,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-16 11:38:37,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:37,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-16 11:38:37,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3758, Unknown=8, NotChecked=762, Total=4692 [2022-11-16 11:38:37,624 INFO L87 Difference]: Start difference. First operand 127 states and 149 transitions. Second operand has 60 states, 55 states have (on average 2.090909090909091) internal successors, (115), 47 states have internal predecessors, (115), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 11:38:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:38:51,655 INFO L93 Difference]: Finished difference Result 181 states and 215 transitions. [2022-11-16 11:38:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-16 11:38:51,656 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 55 states have (on average 2.090909090909091) internal successors, (115), 47 states have internal predecessors, (115), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 141 [2022-11-16 11:38:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:38:51,657 INFO L225 Difference]: With dead ends: 181 [2022-11-16 11:38:51,657 INFO L226 Difference]: Without dead ends: 129 [2022-11-16 11:38:51,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=385, Invalid=8740, Unknown=19, NotChecked=1158, Total=10302 [2022-11-16 11:38:51,660 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 89 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 3404 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 4784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1322 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:38:51,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1741 Invalid, 4784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3404 Invalid, 0 Unknown, 1322 Unchecked, 4.9s Time] [2022-11-16 11:38:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-16 11:38:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2022-11-16 11:38:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 83 states have internal predecessors, (89), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-16 11:38:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 150 transitions. [2022-11-16 11:38:51,679 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 150 transitions. Word has length 141 [2022-11-16 11:38:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:38:51,680 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 150 transitions. [2022-11-16 11:38:51,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 55 states have (on average 2.090909090909091) internal successors, (115), 47 states have internal predecessors, (115), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 11:38:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 150 transitions. [2022-11-16 11:38:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-16 11:38:51,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:38:51,682 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:51,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-16 11:38:51,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:38:51,895 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:38:51,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:51,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1641892614, now seen corresponding path program 7 times [2022-11-16 11:38:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:51,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016627464] [2022-11-16 11:38:51,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:52,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:38:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:38:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:52,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:38:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:52,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:38:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:52,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:38:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:52,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:38:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:52,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:38:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:52,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:38:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:52,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:38:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:38:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:38:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:38:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:38:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:38:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:38:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:38:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:38:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:38:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:38:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:38:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:38:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-16 11:38:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-11-16 11:38:53,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:53,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016627464] [2022-11-16 11:38:53,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016627464] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:38:53,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677400073] [2022-11-16 11:38:53,467 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 11:38:53,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:38:53,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:38:53,468 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:38:53,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:39:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:00,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 3504 conjuncts, 145 conjunts are in the unsatisfiable core [2022-11-16 11:39:00,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:39:01,525 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 13 treesize of output 9 [2022-11-16 11:39:07,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:07,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 74 [2022-11-16 11:39:07,435 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 11:39:07,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-16 11:39:08,647 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-16 11:39:08,647 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-16 11:39:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-16 11:39:08,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:39:18,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677400073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:39:18,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:39:18,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 43] total 55 [2022-11-16 11:39:18,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221697739] [2022-11-16 11:39:18,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:39:18,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-16 11:39:18,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:18,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-16 11:39:18,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3854, Unknown=4, NotChecked=0, Total=4032 [2022-11-16 11:39:18,263 INFO L87 Difference]: Start difference. First operand 128 states and 150 transitions. Second operand has 55 states, 50 states have (on average 2.48) internal successors, (124), 41 states have internal predecessors, (124), 9 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (33), 11 states have call predecessors, (33), 8 states have call successors, (33) [2022-11-16 11:39:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:39:26,140 INFO L93 Difference]: Finished difference Result 178 states and 209 transitions. [2022-11-16 11:39:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 11:39:26,140 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 50 states have (on average 2.48) internal successors, (124), 41 states have internal predecessors, (124), 9 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (33), 11 states have call predecessors, (33), 8 states have call successors, (33) Word has length 142 [2022-11-16 11:39:26,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:39:26,141 INFO L225 Difference]: With dead ends: 178 [2022-11-16 11:39:26,142 INFO L226 Difference]: Without dead ends: 128 [2022-11-16 11:39:26,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=359, Invalid=7118, Unknown=5, NotChecked=0, Total=7482 [2022-11-16 11:39:26,143 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 274 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 3150 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 4257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 3150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 864 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:39:26,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1128 Invalid, 4257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 3150 Invalid, 0 Unknown, 864 Unchecked, 4.2s Time] [2022-11-16 11:39:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-16 11:39:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2022-11-16 11:39:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.075) internal successors, (86), 81 states have internal predecessors, (86), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-16 11:39:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2022-11-16 11:39:26,163 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 142 [2022-11-16 11:39:26,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:39:26,163 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2022-11-16 11:39:26,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 50 states have (on average 2.48) internal successors, (124), 41 states have internal predecessors, (124), 9 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (33), 11 states have call predecessors, (33), 8 states have call successors, (33) [2022-11-16 11:39:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2022-11-16 11:39:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-16 11:39:26,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:39:26,164 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:26,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:39:26,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:39:26,379 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:39:26,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:26,380 INFO L85 PathProgramCache]: Analyzing trace with hash -359058118, now seen corresponding path program 8 times [2022-11-16 11:39:26,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:26,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377100563] [2022-11-16 11:39:26,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:26,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:39:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:39:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:39:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:39:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:39:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:39:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:39:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:39:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:39:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:39:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:39:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:39:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:39:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:39:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:39:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:39:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:29,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:39:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:30,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:39:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:30,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:39:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:30,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:39:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:39:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:31,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-16 11:39:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-16 11:39:31,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:31,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377100563] [2022-11-16 11:39:31,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377100563] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:39:31,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604403967] [2022-11-16 11:39:31,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:39:31,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:39:31,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:39:31,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:39:31,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:39:42,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:39:42,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:39:42,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 3720 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-16 11:39:42,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:39:42,580 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 13 treesize of output 9 [2022-11-16 11:39:42,770 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7591 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_102| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_102|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7591)) |c_#memory_int|))) is different from true [2022-11-16 11:39:42,789 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1315_103| Int) (v_ArrVal_7591 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_102| Int) (v_ArrVal_7595 Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7591) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7595)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_103| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_102|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_103|))) is different from true [2022-11-16 11:39:42,816 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1315_103| Int) (v_ArrVal_7591 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_104| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_102| Int) (v_ArrVal_7597 Int) (v_ArrVal_7595 Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7591) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7595) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_104| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7597)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_104| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_103| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_104|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_102|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_103|))) is different from true [2022-11-16 11:39:42,851 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1315_105| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_103| Int) (v_ArrVal_7591 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_104| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_102| Int) (v_ArrVal_7602 Int) (v_ArrVal_7597 Int) (v_ArrVal_7595 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_104| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_105|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7591) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7595) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_104| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7597) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_105| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7602))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_105| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_103| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_104|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_102|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_103|))) is different from true [2022-11-16 11:39:42,904 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1315_105| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_106| Int) (v_ArrVal_7608 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_103| Int) (v_ArrVal_7591 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_104| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_102| Int) (v_ArrVal_7602 Int) (v_ArrVal_7597 Int) (v_ArrVal_7595 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_104| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_105|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_105| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_106|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7591) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7595) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_104| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7597) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_105| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7602) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_106| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7608)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_106| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_103| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_104|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_102|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_103|))) is different from true [2022-11-16 11:39:42,972 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7608 Int) (v_ArrVal_7612 Int) (v_ArrVal_7602 Int) (v_ArrVal_7597 Int) (v_ArrVal_7595 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_105| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_106| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_103| Int) (v_ArrVal_7591 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_104| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_102| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_107| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_104| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_105|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_105| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_106|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_107| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_106| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_107|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_103| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_104|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_102|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7591) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7595) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_104| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7597) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_105| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7602) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_106| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7608) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_107| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7612)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_103|))) is different from true [2022-11-16 11:39:43,053 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_7608 Int) (v_ArrVal_7615 Int) (v_ArrVal_7612 Int) (v_ArrVal_7602 Int) (v_ArrVal_7597 Int) (v_ArrVal_7595 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_105| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_106| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_103| Int) (v_ArrVal_7591 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_104| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_102| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_107| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_108| Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_104| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_105|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_105| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_106|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_107| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_108|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_106| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_107|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_103| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_104|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7591) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_103| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7595) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_104| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7597) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_105| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7602) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_106| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7608) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_107| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7612) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_108| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_7615))) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_102|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_102| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_103|))) is different from true [2022-11-16 11:39:44,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:39:44,585 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-16 11:39:44,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 35 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 87 [2022-11-16 11:39:44,721 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 11:39:44,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2022-11-16 11:39:46,025 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-16 11:39:46,025 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 61 [2022-11-16 11:39:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 150 trivial. 28 not checked. [2022-11-16 11:39:46,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:40:10,958 WARN L233 SmtUtils]: Spent 14.10s on a formula simplification that was a NOOP. DAG size: 134 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:40:10,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604403967] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:40:10,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:40:10,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 62 [2022-11-16 11:40:10,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945624793] [2022-11-16 11:40:10,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:40:10,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-16 11:40:10,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:10,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-16 11:40:10,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3882, Unknown=10, NotChecked=910, Total=4970 [2022-11-16 11:40:10,964 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 62 states, 57 states have (on average 2.0526315789473686) internal successors, (117), 49 states have internal predecessors, (117), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 11:40:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:40:25,881 INFO L93 Difference]: Finished difference Result 178 states and 210 transitions. [2022-11-16 11:40:25,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-16 11:40:25,882 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 57 states have (on average 2.0526315789473686) internal successors, (117), 49 states have internal predecessors, (117), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) Word has length 142 [2022-11-16 11:40:25,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:40:25,883 INFO L225 Difference]: With dead ends: 178 [2022-11-16 11:40:25,883 INFO L226 Difference]: Without dead ends: 130 [2022-11-16 11:40:25,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=375, Invalid=8755, Unknown=18, NotChecked=1358, Total=10506 [2022-11-16 11:40:25,885 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 151 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 3800 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 5531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1602 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:40:25,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 2016 Invalid, 5531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3800 Invalid, 0 Unknown, 1602 Unchecked, 5.5s Time] [2022-11-16 11:40:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-16 11:40:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-16 11:40:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-16 11:40:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2022-11-16 11:40:25,911 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 142 [2022-11-16 11:40:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:40:25,912 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2022-11-16 11:40:25,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 57 states have (on average 2.0526315789473686) internal successors, (117), 49 states have internal predecessors, (117), 11 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (33), 15 states have call predecessors, (33), 10 states have call successors, (33) [2022-11-16 11:40:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2022-11-16 11:40:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-16 11:40:25,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:40:25,913 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:40:25,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:40:26,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 11:40:26,129 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:40:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:26,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1843048178, now seen corresponding path program 9 times [2022-11-16 11:40:26,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:26,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500013081] [2022-11-16 11:40:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:26,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:40:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:40:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:40:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:40:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:40:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:40:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:40:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:40:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:40:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:40:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:40:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:40:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:40:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:40:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:40:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:40:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:40:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:40:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:40:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:40:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:29,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:40:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:30,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-16 11:40:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2022-11-16 11:40:30,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:30,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500013081] [2022-11-16 11:40:30,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500013081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:40:30,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266959403] [2022-11-16 11:40:30,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:40:30,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:40:30,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:40:30,882 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:40:30,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:41:53,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 11:41:53,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:41:53,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 3437 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-16 11:41:53,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:41:53,525 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 13 treesize of output 9 [2022-11-16 11:41:53,617 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 26 treesize of output 14 [2022-11-16 11:41:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 46 proven. 22 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-16 11:41:54,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:41:57,532 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 70 treesize of output 62 [2022-11-16 11:41:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 64 proven. 4 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-16 11:41:57,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266959403] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:41:57,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:41:57,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 26] total 58 [2022-11-16 11:41:57,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61167864] [2022-11-16 11:41:57,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:41:57,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-16 11:41:57,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:41:57,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-16 11:41:57,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3102, Unknown=0, NotChecked=0, Total=3306 [2022-11-16 11:41:57,828 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand has 58 states, 50 states have (on average 2.58) internal successors, (129), 49 states have internal predecessors, (129), 19 states have call successors, (44), 7 states have call predecessors, (44), 12 states have return successors, (41), 22 states have call predecessors, (41), 18 states have call successors, (41) [2022-11-16 11:42:21,914 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 [] [2022-11-16 11:42:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:22,695 INFO L93 Difference]: Finished difference Result 185 states and 219 transitions. [2022-11-16 11:42:22,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-16 11:42:22,696 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 50 states have (on average 2.58) internal successors, (129), 49 states have internal predecessors, (129), 19 states have call successors, (44), 7 states have call predecessors, (44), 12 states have return successors, (41), 22 states have call predecessors, (41), 18 states have call successors, (41) Word has length 143 [2022-11-16 11:42:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:22,697 INFO L225 Difference]: With dead ends: 185 [2022-11-16 11:42:22,697 INFO L226 Difference]: Without dead ends: 129 [2022-11-16 11:42:22,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 280 SyntacticMatches, 12 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=581, Invalid=8349, Unknown=0, NotChecked=0, Total=8930 [2022-11-16 11:42:22,700 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 252 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 3139 mSolverCounterSat, 125 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 3139 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:22,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1319 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 3139 Invalid, 1 Unknown, 0 Unchecked, 22.2s Time] [2022-11-16 11:42:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-16 11:42:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-16 11:42:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.072289156626506) internal successors, (89), 84 states have internal predecessors, (89), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-16 11:42:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2022-11-16 11:42:22,725 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 143 [2022-11-16 11:42:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:22,725 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2022-11-16 11:42:22,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 50 states have (on average 2.58) internal successors, (129), 49 states have internal predecessors, (129), 19 states have call successors, (44), 7 states have call predecessors, (44), 12 states have return successors, (41), 22 states have call predecessors, (41), 18 states have call successors, (41) [2022-11-16 11:42:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2022-11-16 11:42:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-16 11:42:22,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:22,727 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:22,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:22,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 11:42:22,951 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:22,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:22,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2125296268, now seen corresponding path program 10 times [2022-11-16 11:42:22,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:22,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931202608] [2022-11-16 11:42:22,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:26,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:42:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:26,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:42:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:26,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:42:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:26,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:42:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:26,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:42:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:26,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:42:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:26,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:42:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:26,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:42:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:42:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:42:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:42:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:42:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:42:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:42:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:42:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:42:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:42:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:42:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:42:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:42:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:27,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:42:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:29,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-16 11:42:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 28 proven. 48 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-16 11:42:29,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:29,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931202608] [2022-11-16 11:42:29,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931202608] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:42:29,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260817723] [2022-11-16 11:42:29,356 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:42:29,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:29,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:29,357 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:29,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:42:41,370 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:42:41,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:42:41,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 4005 conjuncts, 149 conjunts are in the unsatisfiable core [2022-11-16 11:42:41,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:42,639 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 13 treesize of output 9 [2022-11-16 11:42:42,864 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1315_154| Int) (v_ArrVal_10896 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10896))) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_154|))) is different from true [2022-11-16 11:42:42,886 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1315_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_155| Int) (v_ArrVal_10896 Int) (v_ArrVal_10900 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_155|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10896) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10900))) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_154|))) is different from true [2022-11-16 11:42:42,914 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_10904 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_155| Int) (v_ArrVal_10896 Int) (v_ArrVal_10900 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_155|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10896) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10900) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10904)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_154|))) is different from true [2022-11-16 11:42:42,954 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_10904 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_157| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_155| Int) (v_ArrVal_10896 Int) (v_ArrVal_10910 Int) (v_ArrVal_10900 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_155|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_157| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10896) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10900) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10904) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10910)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_154|))) is different from true [2022-11-16 11:42:43,013 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_10904 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_158| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_157| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_155| Int) (v_ArrVal_10896 Int) (v_ArrVal_10910 Int) (v_ArrVal_10900 Int) (v_ArrVal_10914 Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10896) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10900) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10904) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10910) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_158| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10914)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_155|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_157| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_158|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_158| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_154|))) is different from true [2022-11-16 11:42:43,092 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_10916 Int) (v_ArrVal_10904 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_158| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_159| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_157| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_155| Int) (v_ArrVal_10896 Int) (v_ArrVal_10910 Int) (v_ArrVal_10900 Int) (v_ArrVal_10914 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_155|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_157| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_158|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_158| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_159|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_159| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10896) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10900) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10904) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10910) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_158| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10914) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_159| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10916)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_154|))) is different from true [2022-11-16 11:42:43,209 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1315_160| Int) (v_ArrVal_10916 Int) (v_ArrVal_10904 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_158| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_159| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_157| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_155| Int) (v_ArrVal_10896 Int) (v_ArrVal_10910 Int) (v_ArrVal_10921 Int) (v_ArrVal_10900 Int) (v_ArrVal_10914 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_155|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_157| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_158|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_158| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_159|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10896) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10900) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10904) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10910) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_158| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10914) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_159| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10916) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_160| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10921)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_160| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_154|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_159| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_160|))) is different from true [2022-11-16 11:42:43,374 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1315_161| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_160| Int) (v_ArrVal_10916 Int) (v_ArrVal_10904 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_158| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_159| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_157| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_155| Int) (v_ArrVal_10896 Int) (v_ArrVal_10910 Int) (v_ArrVal_10921 Int) (v_ArrVal_10923 Int) (v_ArrVal_10900 Int) (v_ArrVal_10914 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_160| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_161|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_155|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_157| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_158|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_158| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_159|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_161| 1) |c_#Ultimate.C_memcpy_#t~loopctr1315|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10896) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10900) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10904) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10910) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_158| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10914) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_159| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10916) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_160| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10921) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_161| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10923)) |c_#memory_int|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_154|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_159| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_160|))) is different from true [2022-11-16 11:42:43,572 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_#Ultimate.C_memcpy_#t~loopctr1315_161| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_162| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_160| Int) (v_ArrVal_10916 Int) (v_ArrVal_10904 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_158| Int) (v_ArrVal_10929 Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_159| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_156| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_157| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_154| Int) (|v_#Ultimate.C_memcpy_#t~loopctr1315_155| Int) (v_ArrVal_10896 Int) (v_ArrVal_10910 Int) (v_ArrVal_10921 Int) (v_ArrVal_10923 Int) (v_ArrVal_10900 Int) (v_ArrVal_10914 Int)) (and (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_157|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_160| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_161|) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base| (store (store (store (store (store (store (store (store (store (select |c_old(#memory_int)| |c_#Ultimate.C_memcpy_dest.base|) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10896) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10900) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_156| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10904) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_157| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10910) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_158| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10914) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_159| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10916) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_160| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10921) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_161| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10923) (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_162| |c_#Ultimate.C_memcpy_dest.offset|) v_ArrVal_10929)) |c_#memory_int|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_154| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_155|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_157| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_158|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_155| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_156|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_158| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_159|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_161| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_162|) (<= 0 |v_#Ultimate.C_memcpy_#t~loopctr1315_154|) (<= (+ |v_#Ultimate.C_memcpy_#t~loopctr1315_159| 1) |v_#Ultimate.C_memcpy_#t~loopctr1315_160|))) is different from true [2022-11-16 11:42:47,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:47,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:42:48,127 INFO L321 Elim1Store]: treesize reduction 153, result has 45.9 percent of original size [2022-11-16 11:42:48,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 82 treesize of output 160 [2022-11-16 11:42:48,394 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 11:42:48,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 36 [2022-11-16 11:42:50,093 INFO L321 Elim1Store]: treesize reduction 53, result has 13.1 percent of original size [2022-11-16 11:42:50,093 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 71 [2022-11-16 11:42:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 57 trivial. 45 not checked. [2022-11-16 11:42:50,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:43:09,465 WARN L233 SmtUtils]: Spent 16.21s on a formula simplification that was a NOOP. DAG size: 220 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-16 11:43:31,334 WARN L233 SmtUtils]: Spent 14.28s on a formula simplification that was a NOOP. DAG size: 151 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:43:31,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260817723] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:43:31,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:43:31,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 47] total 78 [2022-11-16 11:43:31,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086873215] [2022-11-16 11:43:31,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:43:31,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-16 11:43:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:43:31,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-16 11:43:31,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=5822, Unknown=12, NotChecked=1440, Total=7482 [2022-11-16 11:43:31,343 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand has 78 states, 71 states have (on average 2.0) internal successors, (142), 63 states have internal predecessors, (142), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-16 11:43:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:43:57,990 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2022-11-16 11:43:57,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 11:43:57,991 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 71 states have (on average 2.0) internal successors, (142), 63 states have internal predecessors, (142), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) Word has length 145 [2022-11-16 11:43:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:43:57,992 INFO L225 Difference]: With dead ends: 185 [2022-11-16 11:43:57,992 INFO L226 Difference]: Without dead ends: 137 [2022-11-16 11:43:57,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2352 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=558, Invalid=14458, Unknown=26, NotChecked=2250, Total=17292 [2022-11-16 11:43:57,994 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 209 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 5069 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 7294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 5069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2051 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:43:57,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1779 Invalid, 7294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 5069 Invalid, 0 Unknown, 2051 Unchecked, 7.3s Time] [2022-11-16 11:43:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-16 11:43:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2022-11-16 11:43:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.0804597701149425) internal successors, (94), 88 states have internal predecessors, (94), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-16 11:43:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2022-11-16 11:43:58,025 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 145 [2022-11-16 11:43:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:43:58,026 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2022-11-16 11:43:58,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 71 states have (on average 2.0) internal successors, (142), 63 states have internal predecessors, (142), 15 states have call successors, (43), 10 states have call predecessors, (43), 16 states have return successors, (40), 19 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-16 11:43:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2022-11-16 11:43:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-16 11:43:58,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:43:58,028 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:43:58,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:43:58,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:43:58,231 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:43:58,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:43:58,231 INFO L85 PathProgramCache]: Analyzing trace with hash 675796536, now seen corresponding path program 11 times [2022-11-16 11:43:58,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:43:58,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390134706] [2022-11-16 11:43:58,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:43:58,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:44:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:44:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-16 11:44:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 11:44:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:44:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-16 11:44:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:44:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:44:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-16 11:44:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 11:44:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 11:44:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:44:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 11:44:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:44:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:44:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-16 11:44:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-16 11:44:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:44:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:44:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:44:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:44:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:44:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:06,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-16 11:44:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:44:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 55 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-11-16 11:44:06,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:44:06,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390134706] [2022-11-16 11:44:06,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390134706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:44:06,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778161332] [2022-11-16 11:44:06,246 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:44:06,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:44:06,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:44:06,247 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:44:06,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed04a179-2ec4-4cd0-9226-89dd019318c3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process